Computation times of NP sets of different densities
- 31 December 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 34 (1-2), 17-32
- https://doi.org/10.1016/0304-3975(84)90111-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On sparse sets in NP–PInformation Processing Letters, 1983
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Tally languages and complexity classesInformation and Control, 1974