Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
| gptkbp:alsoKnownAs |
gptkb:exclusive-or_satisfiability
|
| gptkbp:canBe |
system of linear equations over GF(2)
|
| gptkbp:clauseType |
XOR (exclusive-or) clauses
|
| gptkbp:complexity |
P
|
| gptkbp:definedIn |
the problem of determining if a system of linear equations over GF(2) is satisfiable
|
| gptkbp:heldBy |
tractable
|
| https://www.w3.org/2000/01/rdf-schema#label |
XOR-SAT
|
| gptkbp:input |
set of XOR clauses
|
| gptkbp:isSolvable |
polynomial time
|
| gptkbp:output |
satisfiable or unsatisfiable
|
| gptkbp:relatedTo |
gptkb:3-SAT
gptkb:2-SAT |
| gptkbp:solvedBy |
gptkb:Gaussian_elimination
|
| gptkbp:studiedBy |
theoretical computer science
|
| gptkbp:unlike |
gptkb:3-SAT
general SAT |
| gptkbp:usedIn |
coding theory
cryptography constraint satisfaction problems |
| gptkbp:variablesDomain |
Boolean variables
|
| gptkbp:bfsParent |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:bfsLayer |
6
|