Observations on complete sets between linear time and polynomial time
From MaRDI portal
Publication:627129
Recommendations
Cites work
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 559220 (Why is no real title available?)
- scientific article; zbMATH DE number 1542049 (Why is no real title available?)
- scientific article; zbMATH DE number 1418967 (Why is no real title available?)
- Logical foundations of proof complexity
- Nondeterministic Space is Closed under Complementation
- Nonerasing, counting, and majority over the linear time hierarchy
- On quasilinear-time complexity theory
- Quasi-realtime languages
- Rudimentary Predicates and Relative Computation
- Satisfiability Is Quasilinear Complete in NQL
- The Boolean Hierarchy I: Structural Properties
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
- The method of forced enumeration for nondeterministic automata
- The polynomial-time hierarchy
Cited in
(5)
This page was built for publication: Observations on complete sets between linear time and polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627129)