recognition /
Complexity /
Complexity.SAT.Completeness /
explainer
No prose has been written for this declaration yet. The Lean source and graph data below render
without it.
generate prose now
formal statement (Lean)
185 theorem polynomial_time_3sat_algorithm (n : Nat)
186 (h : polynomial_time_3sat_algorithm_hypothesis n) :
187 ProgramTarget n →
188 ∃ (alg : CNF n → Option (Assignment n)),
189 (∀ φ, Satisfiable φ → ∃ x, alg φ = some x ∧ evalCNF x φ = true) ∧
190 (∀ φ, ¬Satisfiable φ → alg φ = none) :=
proof body
Term-mode proof.
191 h
192
193 /-- Backpropagation succeeds when there is a unique solution under XOR constraints.
194 This is a semantic existence result that does not rely on a specific step system. -/
depends on (12)
Lean names referenced from this declaration's body.
step
in IndisputableMonolith.Complexity.CellularAutomata
decl_use
Assignment
in IndisputableMonolith.Complexity.RSatEncoding
decl_use
Assignment
in IndisputableMonolith.Complexity.SAT.CNF
decl_use
CNF
in IndisputableMonolith.Complexity.SAT.CNF
decl_use
evalCNF
in IndisputableMonolith.Complexity.SAT.CNF
decl_use
Satisfiable
in IndisputableMonolith.Complexity.SAT.CNF
decl_use
polynomial_time_3sat_algorithm_hypothesis
in IndisputableMonolith.Complexity.SAT.Completeness
decl_use
is
in IndisputableMonolith.Foundation.OptionAEmpiricalProgram
decl_use
is
in IndisputableMonolith.Foundation.SimplicialLedger.EdgeLengthFromPsi
decl_use
is
in IndisputableMonolith.GameTheory.MechanismDesignFromSigma
decl_use
is
in IndisputableMonolith.Mathematics.RamanujanBridge.MockThetaPhantom
decl_use
that
in IndisputableMonolith.NumberTheory.PhiLadderLattice
decl_use