| _version_ | 1866901985344618496 |
|---|---|
| author | Solminov, Ivan |
| author_facet | Solminov, Ivan |
| contents | <p>This preprint presents a new approach to the separation of complexity classes P and NP. Using geometric, algebraic, and spectral methods, the author constructs a framework that suggests the impossibility of solving NP-complete problems by polynomial-time algorithms. The result includes a proof sketch and several theorems leading to the main claim.<br><br>This English version is an automatic translation of the original Russian manuscript. I am not a native English speaker, and some parts may contain linguistic inaccuracies or formatting issues. The Russian version is the primary and more accurate version.<br><br>Feedback and corrections are welcome.<br><br><strong>This version contains a contradiction between the "complex" function (ε=2^(—n)) and the statement of Algphys ⊆ P. The approach is currently being revised, but the concept will be retained.</strong></p> <p> </p> <p> </p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_16759468 |
| institution | Zenodo |
| language | eng |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Why P ≠ NP: A Look Through Geometry, Physics, and Lattices Solminov, Ivan <p>This preprint presents a new approach to the separation of complexity classes P and NP. Using geometric, algebraic, and spectral methods, the author constructs a framework that suggests the impossibility of solving NP-complete problems by polynomial-time algorithms. The result includes a proof sketch and several theorems leading to the main claim.<br><br>This English version is an automatic translation of the original Russian manuscript. I am not a native English speaker, and some parts may contain linguistic inaccuracies or formatting issues. The Russian version is the primary and more accurate version.<br><br>Feedback and corrections are welcome.<br><br><strong>This version contains a contradiction between the "complex" function (ε=2^(—n)) and the statement of Algphys ⊆ P. The approach is currently being revised, but the concept will be retained.</strong></p> <p> </p> <p> </p> |
| title | Why P ≠ NP: A Look Through Geometry, Physics, and Lattices |
| url | https://doi.org/10.5281/zenodo.16759468 |