Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
US
|
| gptkbp:defines |
Given a Boolean formula, decide if it has exactly one satisfying assignment.
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Unique-SAT
|
| gptkbp:introduced |
Valiant
|
| gptkbp:introducedIn |
1976
|
| gptkbp:reduces |
gptkb:SAT
|
| gptkbp:relatedTo |
gptkb:Valiant–Vazirani_theorem
gptkb:coNP NP Boolean satisfiability problem |
| gptkbp:usedIn |
cryptography
proof complexity randomized reductions |
| gptkbp:bfsParent |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:bfsLayer |
6
|