An NL hierarchy

DOI10.1016/0020-0190(91)90057-OzbMath0735.68030OpenAlexW2091919270MaRDI QIDQ1182111

Bud Mishra, Jim Cox, Jian'er Chen

Publication date: 27 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90057-o

zbMATH Keywords

nondeterministic computationspace-bounded computationquery machines

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• New developments in structural complexity theory
• Space-bounded hierarchies and probabilistic computations
• Reductions on NP and p-selective sets
• Nondeterministic Space is Closed under Complementation
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Relativization of questions about log space computability
• Unnamed Item

This page was built for publication: An NL hierarchy