Código del TFG de Ingeniería Informática / Code for the Computer Science Bacherlor's Thesis
-
Updated
Sep 3, 2025 - Python
#
circuit-complexity
Here are 4 public repositories matching this topic...
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.
-
Updated
Aug 7, 2026 - Python
First machine-verified formalization of the natural proofs barrier (Razborov-Rudich 1997) in Lean 4. Zero sorry obligations.
-
Updated
May 12, 2026 - TeX
CL-DIAG: Diagnosing canonicalization leakage in supervised learning under group symmetry
machine-learning deep-learning pytorch data-augmentation invariance neurips shortcut-learning boolean-functions group-symmetry circuit-complexity
-
Updated
Mar 20, 2026 - Python
Add this topic to your repo
To associate your repository with the circuit-complexity topic, visit your repo's landing page and select "manage topics."