Circuit Lower Bound: st Clause Circ
ProvedCircuitLowerBound.stClauseCircalgorithmsanthropic-eth-16a5ce4complexity-theory
The circuit that computes clause number j of the formula of a table from the bits of j has at most 36·(L+1) gates and a number of gates that depends on the table only.
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_Circ_Blocks import Definitions.Def_ToTuring_Poly_Sat import Definitions.Def_ToTuring_Poly_Words import Mathlib.Tactic import Definitions.Def_CircuitLowerBound_Circ_Clause set_option autoImplicit false section section open CircuitLowerBound open ENP Groundwork CircuitLowerBound.Blocks CircuitLowerBound.Clause
Formal statement
theorem CircuitLowerBound.stClauseCirc : StClauseCirc := by sorry
Source