An unambiguous class possessing a complete set

DOI10.1007/BFB0023471zbMATH Open1498.68116OpenAlexW1543627827MaRDI QIDQ5048936FDOQ5048936

Authors: Klaus-Jörn Lange 

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

Recommendations

• Making Nondeterminism Unambiguous
• Complexity classes without machines: on complete languages for UP
• scientific article; zbMATH DE number 1335888
• Unambiguity of circuits
• Promise problems complete for complexity classes

Mathematics Subject Classification ID

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

Cites Work

• A taxonomy of problems with fast parallel algorithms
• Riemann's hypothesis and tests for primality
• Nondeterministic Space is Closed under Complementation
• Complexity classes without machines: on complete languages for UP
• Title not available (Why is that?)
• Title not available (Why is that?)
• The method of forced enumeration for nondeterministic automata
• Symmetric space-bounded computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Time/Space Trade-Offs for Reversible Computation
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• NL-printable sets and nondeterministic Kolmogorov complexity
• Depth-first search in directed planar graphs, revisited
• \textsc{ReachFewL} = \textsc{ReachUL}
• NL-printable sets and nondeterministic Kolmogorov complexity

This page was built for publication: An unambiguous class possessing a complete set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048936)