Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
M. Krause, Ch. Meinel, St. Waack (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Separating from co-, and for oblivious Turing machines of linear access”
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
A note on read- times branching programs
Stasys Jukna (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On sets bounded truth-table reducible to -selective sets
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Lower bounds on the complexity of real-time branching programs
Klaus Kriegel, Stephan Waack (1988)
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:
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: