Resolution of Hartmanis' conjecture for NL-hard sparse sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4087055 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1306868 (Why is no real title available?)
- scientific article; zbMATH DE number 1306869 (Why is no real title available?)
- scientific article; zbMATH DE number 1072529 (Why is no real title available?)
- Constant Depth Reducibility
- Inverting a Vandermonde matrix in minimum parallel time
- Languages that Capture Complexity Classes
- Maze recognizing automata and nondeterministic tape complexity
- Nondeterministic Space is Closed under Complementation
- On Isomorphisms and Density of $NP$ and Other Complete Sets
- On log-tape isomorphisms of complete sets
- On the existence of hard sparse sets under weak reductions
- Parity, circuits, and the polynomial-time hierarchy
- Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
- Turing machines that take advice
- Very Fast Parallel Polynomial Arithmetic
Cited in
(4)
This page was built for publication: Resolution of Hartmanis' conjecture for NL-hard sparse sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575434)
