Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Recurso digital |
| Jazyk: | angličtina |
| Vydáno: |
Zenodo
2025
|
| On-line přístup: | https://doi.org/10.5281/zenodo.15844428 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Obsah:
- <p>This is a working preprint of "Proving P ≠ NP via the Family Collision-Entropy Lemma." We present a novel combinatorial argument showing that any family of Boolean functions with sufficiently low collision entropy can be covered by subexponentially many monochromatic rectangles, and use this to resolve the final barrier in separating P from NP. All core lemmas (Entropy-Drop, Sunflower, Core Agreement) have been fully formalized in Lean 4, and the repository includes complete proof scripts and auxiliary definitions. Future versions will finalize the formal proof of the MCSP lower bound and remove all remaining admitted steps (sorry)</p>