First machine-verified formalization of the natural proofs barrier (Razborov-Rudich 1997) in Lean 4. Zero sorry obligations.
-
Updated
May 12, 2026 - TeX
First machine-verified formalization of the natural proofs barrier (Razborov-Rudich 1997) in Lean 4. Zero sorry obligations.
Exact minimal integer-weight threshold circuits for every 4-input Boolean function (65,536 tables, 222 NPN classes): free-weight optima, capped Pareto frontiers, constructive forms, price of decomposability - all machine-verified.
CL-DIAG: Diagnosing canonicalization leakage in supervised learning under group symmetry
Código del TFG de Ingeniería Informática / Code for the Computer Science Bacherlor's Thesis
To associate your repository with the circuit-complexity topic, visit your repo's landing page and select "manage topics."