Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
- 1 October 1982
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 25 (2), 130-143
- https://doi.org/10.1016/0022-0000(82)90002-2
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Note on Sparse Complete SetsSIAM Journal on Computing, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Inclusion complete tally languages and the Hartmanis-Berman conjectureTheory of Computing Systems, 1977
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976