An unambiguous class possessing a complete set
From MaRDI portal
Publication:5048936
DOI10.1007/BFb0023471zbMath1498.68116MaRDI QIDQ5048936
Publication date: 9 November 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0023471
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
NL-printable sets and Nondeterministic Kolmogorov Complexity, \textsc{ReachFewL} = \textsc{ReachUL}, Depth-first search in directed planar graphs, revisited, NL-printable sets and nondeterministic Kolmogorov complexity
Cites Work
- The method of forced enumeration for nondeterministic automata
- Complexity classes without machines: on complete languages for UP
- Symmetric space-bounded computation
- Riemann's hypothesis and tests for primality
- A taxonomy of problems with fast parallel algorithms
- Nondeterministic Space is Closed under Complementation
- Time/Space Trade-Offs for Reversible Computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item