Published February 4, 2026
| Version v1
Computational notebook
Open
Algebraic Blindness via Local Moment Matching: A Path to P ≠ NP
Description
We present a proof that the Minimum Circuit Size Problem (MCSP) requires super-polynomial circuit size, thereby establishing that NP is not in P/poly. Our argument leverages the structural locality of Sum-of-Squares (SOS) refutations and introduces the technique of Local Moment Matching.
Files
MCSP_Paper_Final.pdf
Files
(227.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:583be44ae6532b0996a518ef9fe53345
|
227.9 kB | Preview Download |
Additional details
Related works
- Is supplemented by
- Software: https://github.com/TALLY-MAX/MCSP-Algebraic-Blindness (URL)