Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:author |
gptkb:Vijay_Vazirani
gptkb:Leslie_Valiant |
| gptkbp:citation |
complexity theory textbooks
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Valiant–Vazirani theorem
|
| gptkbp:impact |
establishes the hardness of unique SAT under randomized reductions
|
| gptkbp:namedAfter |
gptkb:Vijay_Vazirani
gptkb:Leslie_Valiant |
| gptkbp:publicationYear |
1985
|
| gptkbp:publishedIn |
Proceedings of the 17th Annual ACM Symposium on Theory of Computing
|
| gptkbp:relatedTo |
gptkb:NP-completeness
randomized reductions unique satisfiability |
| gptkbp:state |
If there is a polynomial-time algorithm for solving the unique satisfiability problem, then there is a randomized polynomial-time algorithm for solving the general satisfiability problem.
|
| gptkbp:bfsParent |
gptkb:Unique-SAT
gptkb:Leslie_Marian_Valiant |
| gptkbp:bfsLayer |
7
|