Graph isomorphism is in the low hierarchy
- 1 December 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 37 (3) , 312-323
- https://doi.org/10.1016/0022-0000(88)90010-4
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- On Circuit-Size Complexity and the Low Hierarchy in NPSIAM Journal on Computing, 1985
- BPP and the polynomial hierarchyInformation Processing Letters, 1983
- Strong nondeterministic polynomial-time reducibilitiesTheoretical Computer Science, 1982
- 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
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975