Complexity arguments in algebraic language theory
Helmut Alt, Kurt Mehlhorn (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Nonuniform complexity classes specified by lower and upper bounds”
Complexity arguments in algebraic language theory
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:
Immunity and simplicity for exact counting and other counting classes
J. Rothe (1999)
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:
Combined complexity classes for finite functions
Y. Breitbart, F. D. Lewis (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Reversals-space-parallelism tradeoffs for language recognition
Juraj Hromkovič (1991)
Mathematica Slovaca
Similarity: