The difference and truth-table hierarchies for NP
Johannes Köbler, Uwe Schöning, Klaus W. Wagner (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On the positive and the inversion complexity of Boolean functions”
The difference and truth-table hierarchies for NP
A note on read- times branching programs
Stasys Jukna (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Communication complexity and lower bounds on multilective computations
Juraj Hromkovič (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the complexity of the hidden weighted bit function for various BDD models
Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Combined complexity classes for finite functions
Y. Breitbart, F. D. Lewis (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Branching programs provide lower bounds on the area of VLSI circuits
Juraj Hromkovič (1991)
Kybernetika
Similarity: