On some natural complete operators
- 31 December 1985
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 37, 1-30
- https://doi.org/10.1016/0304-3975(85)90085-4
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Relativized polynomial hierarchies extending two levelsTheory of Computing Systems, 1984
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- A note on complete sets and transitive closureTheory of Computing Systems, 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 counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Polynomial Space and Transitive ClosureSIAM Journal on Computing, 1979
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Independence results in computer scienceACM SIGACT News, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975