A comparison of polynomial time completeness notions
- 1 October 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 54 (2-3) , 249-265
- https://doi.org/10.1016/0304-3975(87)90132-0
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On one-one polynomial time equivalence relationsTheoretical Computer Science, 1985
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Qualitative relativizations of complexity classesJournal of Computer and System Sciences, 1985
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- Completeness, Approximation and DensitySIAM Journal on Computing, 1981
- 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
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975