On the structure of sets in NP and other complexity classes
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 15 (2), 181-200
- https://doi.org/10.1016/0304-3975(81)90069-4
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Relationship between density and deterministic complexity of MP-complete languagesLecture Notes in Computer Science, 1978
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Minimal pairs of polynomial degrees with subexponential complexityTheoretical Computer Science, 1976
- On Reducibility to Complex or Sparse SetsJournal of the ACM, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- The honest subrecursive classes are a latticeInformation and Control, 1974
- Recursive Properties of Abstract Complexity ClassesJournal of the ACM, 1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971