On sparse sets in NP–P
- 26 February 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 16 (2), 55-60
- https://doi.org/10.1016/0020-0190(83)90024-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Relativizing time and spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Inclusion complete tally languages and the Hartmanis-Berman conjectureTheory of Computing Systems, 1977
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Tally languages and complexity classesInformation and Control, 1974