Pages that link to "Item:Q1249940"
From MaRDI portal
The following pages link to On log-tape isomorphisms of complete sets (Q1249940):
Displaying 15 items.
- Complexity results in graph reconstruction (Q867853) (← links)
- Reductions among polynomial isomorphism types (Q1077412) (← links)
- A note on natural complete sets and Goedel numberings (Q1163015) (← links)
- Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets (Q1276171) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- The relative power of logspace and polynomial time reductions (Q1312179) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization (Q1362330) (← links)
- Resolution of Hartmanis' conjecture for NL-hard sparse sets (Q1575434) (← links)
- On sparseness, reducibilities, and complexity (Q1779309) (← links)
- For completeness, sublogarithmic space is no space. (Q1853022) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- Query-monotonic Turing reductions (Q2383592) (← links)
- Completeness for nondeterministic complexity classes (Q3979608) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
