On log-tape isomorphisms of complete sets
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3532523 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3586493 (Why is no real title available?)
- New problems complete for nondeterministic log space
- On Isomorphisms and Density of NP and Other Complete Sets
- Space-bounded reducibility among combinatorial problems
- The complexity of theorem-proving procedures
Cited in
(15)- Reductions among polynomial isomorphism types
- A note on natural complete sets and Goedel numberings
- Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis
- The relative power of logspace and polynomial time reductions
- Space-efficient recognition of sparse self-reducible languages
- DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization
- Resolution of Hartmanis' conjecture for NL-hard sparse sets
- On sparseness, reducibilities, and complexity
- For completeness, sublogarithmic space is no space.
- Collapsing degrees via strong computation
- Query-monotonic Turing reductions
- Completeness for nondeterministic complexity classes
- On the complexity of graph reconstruction
- Complexity results in graph reconstruction
This page was built for publication: On log-tape isomorphisms of complete sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249940)
