Separating from co-, and for oblivious Turing machines of linear access
Matthias Krause (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines”
Separating from co-, and for oblivious Turing machines of linear access
Nonuniform complexity classes specified by lower and upper bounds
José L. Balcázar, Joaquim Gabarró (1989)
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:
Complexity classes between and
J. Castro, C. Seara (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Immunity and simplicity for exact counting and other counting classes
J. Rothe (1999)
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 note on read- times branching programs
Stasys Jukna (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: