Circuit Lower Bound: st Flip
ProvedCircuitLowerBound.stFlipalgorithmsanthropic-eth-16a5ce4complexity-theory
When pos m equals top (nu m), whether the table codeOf (nu m) fits and its formula, with L =
2^(nu m), is satisfiable is decided in time polynomial in m.
Preamble
/- Copyright (c) 2026 Anthropic, PBC. All rights reserved. Released under Apache 2.0; SPDX-License-Identifier: Apache-2.0. Source and original notices: https://github.com/anthropics/formal-math/blob/16a5ce41304fcdaea4e0be7c132e1c361dc26da5/eth/NOTICE -/ import Definitions.Def_CircuitLowerBound_Cert_Sched import Definitions.Def_CircuitLowerBound_Small import Mathlib.Tactic import Definitions.Def_CircuitLowerBound_Cert_TabF set_option autoImplicit false section section open CircuitLowerBound open ENP Groundwork TabF
Formal statement
theorem CircuitLowerBound.stFlip : StFlip := by sorry
Source