Graph isomorphism is in the low hierarchy

Journal of Computer and System Sciences

Volumn 37, Issue 3, 1988, Pages 312-323

  Schöning, Uwe ^a  

^a EWH Koblenz lnformatik Rheinau 34 D5400 Koblenz West Germany ^*

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--GRAPH THEORY; SYSTEMS SCIENCE AND CYBERNETICS--HIERARCHICAL SYSTEMS;

GRAPH ISOMORPHISM; POLYNOMIAL-TIME HIERARCHY;

AUTOMATA THEORY;

EID: 0024128620     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(88)90010-4     Document Type: Article

References (31)

1. Reducibility, randomness, and intractability
2. On counting problems and the polynomial time hierarchy
3. Trading group theory for randomness, in
4. A with probability 1
5. On isomorphism and density of NP and other complete sets
6. Does co-NP have short interactive proofs?
7. Universal classes of hash functions
8. Computational complexity of probabilistic Turing machines
9. The knowledge complexity of interctive proofs
10. Private coins versus public coins in interactive proof systems
11. Proofs that yield nothing but their validity and a methodology of crypographic protocol design
12. Group-Theoretic Algorithms and Graph Isomorphism
13. Reducibility among combinatorial problems
14. Some connections between non-uniform and uniform complexity classes
15. On circuit-size complexity and the low hierarchy in NP
16. On the structure of polynomial time reducibilities
17. BPP and the polynomial hierarchy
18. Strong nondeterministic polynomial-time reducibilities
19. A note on the graph isomorphism counting problem
20. Optimal algorithms for self-reducible problems
21. A low and a high hierarchy within NP
22. On small generators
23. Complexity and Structure
24. A complexity theoretic approach to randomness
25. The polynomial-time hierarchy
26. On approximation algorithms for # P
27. Some consequences of non-uniform conditions on uniform classes
28. Probabilistic quantifiers, adversaries, and complexity classes: an overview