`SatisfiableXOR`

definition

show as: view math explainer →

module: IndisputableMonolith.Complexity.SAT.XOR
domain: Complexity
line: 100 · github
papers citing: none yet

open explainer

Read the cached plain-language explainer.

open lean source

IndisputableMonolith.Complexity.SAT.XOR on GitHub at line 100.

browse module

All declarations in this module, on Recognition.

explainer page

A cached Ask Recognition explainer exists for this declaration.

open explainer

depends on

formal source

  97  H : XORSystem n
  98
  99/-- Satisfiable under XOR constraints. -/
 100def SatisfiableXOR {n} (ψ : CNFWithXOR n) : Prop :=
 101  ∃ a : Assignment n, evalCNF a ψ.φ = true ∧ satisfiesSystem a ψ.H
 102
 103/-- Unique solution under XOR constraints. -/
 104def UniqueSolutionXOR {n} (ψ : CNFWithXOR n) : Prop :=
 105  ∃! a : Assignment n, evalCNF a ψ.φ = true ∧ satisfiesSystem a ψ.H
 106
 107end SAT
 108end Complexity
 109end IndisputableMonolith

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.