Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 659-667

  Klivans, Adam R ^a   van Melkebeek, Dieter ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

GRAPH NONISOMORPHISM;

COMPUTATIONAL COMPLEXITY;

EID: 0032631765     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301428     Document Type: Article

References (38)