NP IS AS EASY AS DETECTING UNIQUE SOLUTIONS.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1985, Pages 458-463

  Valiant, L G ^a   Vazirani, V V ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NP-COMPLETENESS; RANDOMIZED POLYNOMIAL-TIME REDUCTIONS; SATISFIABILITY;

COMPUTER METATHEORY;

EID: 0021977093     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/22145.22196     Document Type: Conference Paper

References (22)