NP might not be as easy as detecting unique solutions

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 203-208

  Beigel, Richard ^a   Buhrman, Harry ^a   Fortnow, Lance ^a  

^a LEHIGH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

POLYNOMIAL-TIME ISOMORPHIC;

COMPUTATIONAL COMPLEXITY;

EID: 0031638395     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276737     Document Type: Conference Paper

References (35)