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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A selection property of the boolean -calculus and some of its applications”
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:
Bounded queries to arbitrary sets
A. Lozano (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the orthogonalization of arbitrary Boolean formulae.
Bruni, Renato (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity:
On the restricted equivalence for subclasses of propositional logic
A. Flögel, H. Kleine Büning, T. Lettmann (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the positive and the inversion complexity of Boolean functions
V. Dičiūnas (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Complexity of -term reductions
M. Dezani-Ciancaglini, S. Ronchi Della Rocca, L. Saitta (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: