Some modifications of auxiliary pushdown automata
G. Buntrock, F. Drewes, C. Lautemann, T. Mossakowski (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On the parallel complexity of linear groups”
Some modifications of auxiliary pushdown automata
A hierarchy that does not collapse : alternations in low level space
Viliam Geffert (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
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:
Complexity classes between and
J. Castro, C. Seara (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
Birgit Jenner, Bernd Kirsig (1989)
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:
Sublogarithmic -space is not closed under complement and other separation results
V. Geffert (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: