A classification of complexity core lattices
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 47 (2) , 121-130
- https://doi.org/10.1016/0304-3975(86)90140-4
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The density and complexity of polynomial cores for intractable setsInformation and Control, 1986
- Optimal Approximations and Polynomially Levelable SetsSIAM Journal on Computing, 1986
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Hard-core theorems for complexity classesJournal of the ACM, 1985
- Immunity, Relativizations, and NondeterminismSIAM Journal on Computing, 1984
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- On Reducibility to Complex or Sparse SetsJournal of the ACM, 1975