Graph isomorphism is in the low hierarchy
- 31 January 2006
- book chapter
- Published by Springer Nature
- p. 114-124
- https://doi.org/10.1007/bfb0039599
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- On Circuit-Size Complexity and the Low Hierarchy in NPSIAM Journal on Computing, 1985
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- BPP and the polynomial hierarchyInformation Processing Letters, 1983
- Degrees of UnsolvabilityPublished by Springer Nature ,1983
- Strong nondeterministic polynomial-time reducibilitiesTheoretical Computer Science, 1982
- Group-Theoretic Algorithms and Graph IsomorphismLecture Notes in 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