PNP[(log )] and sparse turing-complete sets for NP
Open Access
- 1 December 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 39 (3) , 282-298
- https://doi.org/10.1016/0022-0000(89)90024-x
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy CollapsesSIAM Journal on Computing, 1988
- The Boolean Hierarchy I: Structural PropertiesSIAM Journal on Computing, 1988
- The complexity of optimization problemsJournal of Computer and System Sciences, 1988
- On relativized exponential and probabilistic complexity classesInformation and Control, 1986
- On the complexity of unique solutionsJournal of the ACM, 1984
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- On the unique satisfiability problemInformation and Control, 1982
- A note on sparse oracles for NPJournal of Computer and System Sciences, 1982
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975