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:
Displaying similar documents to “A non-deteministic time hierarchy over the reals.”
Nonuniform complexity classes specified by lower and upper bounds
Combined complexity classes for finite functions
Y. Breitbart, F. D. Lewis (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Complexity arguments in algebraic language theory
Helmut Alt, Kurt Mehlhorn (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A Turing machine oracle hierarchy. I.
Stanislav Žák (1980)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
On ranking 1-way finitely ambiguous NL languages and -complete census functions
A. Bertoni, M. Goldwurm (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A Turing machine space hierarchy
Stanislav Žák (1979)
Kybernetika
Similarity: