Immunity and simplicity for exact counting and other counting classes
J. Rothe (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Function operators spanning the arithmetical and the polynomial hierarchy”
Immunity and simplicity for exact counting and other counting classes
Complexity classes between and
J. Castro, C. Seara (1996)
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:
A note on separating the relativized polynomial time hierarchy by immune sets
Ker-I Ko (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A survey on real structural complexity theory.
Meer, Klaus, Michaux, Christian (1997)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
Limiting characterizations of low level space complexity classes
Michèle Angelaccio, Marco Protasi (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The role of rudimentary relations in complexity theory
Hugo Volger (1984)
Mémoires de la Société Mathématique de France
Similarity:
Self-reducibility structures and solutions of NP problems.
José L. Balcázar Navarro (1989)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
Using polynomial time self-reducibility structures, we characterize certain helping notions, show how the characterization provides the main tool for the proof of known relationships between decisional and functional NP-complete problems, and extend this relationships to the case of optimization NP-complete problems.