Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
| gptkbp:citation |
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979
|
| gptkbp:clauseType |
not-all-equal
|
| gptkbp:defines |
Given a Boolean formula in conjunctive normal form with three literals per clause, is there a truth assignment such that in each clause, not all literals have the same truth value?
|
| gptkbp:fullName |
Not-All-Equal 3-Satisfiability
|
| gptkbp:generalizes |
NAE-k-SAT
|
| gptkbp:hasSpecialCase |
gptkb:NAE-SAT
|
| https://www.w3.org/2000/01/rdf-schema#label |
NAE-3SAT
|
| gptkbp:NP-complete |
true
|
| gptkbp:reduces |
gptkb:3SAT
MAX-CUT |
| gptkbp:relatedTo |
gptkb:3SAT
|
| gptkbp:satisfiabilityType |
Boolean satisfiability problem
|
| gptkbp:studiedBy |
1970s
|
| gptkbp:usedIn |
gptkb:complexity_theory
theoretical computer science |
| gptkbp:variablesPerClause |
3
|
| gptkbp:bfsParent |
gptkb:Not-All-Equal_3SAT
|
| gptkbp:bfsLayer |
7
|