| _version_ | 1866902108997943296 |
|---|---|
| author | Jorge, G. Pardo |
| author_facet | Jorge, G. Pardo |
| contents | <p>This document presents a formal proof that no deterministic polynomial-time function can reduce the SAT search space without risking the loss of valid solutions. The result implies SAT ∉ P and, due to its NP-completeness, that P ≠ NP.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_15385363 |
| institution | Zenodo |
| language | |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | A Formal Proof That P ≠ NP via SAT Space Irreducibility Jorge, G. Pardo P vs NP, SAT, Computational Complexity, Structural Proof, Deterministic Turing Machine <p>This document presents a formal proof that no deterministic polynomial-time function can reduce the SAT search space without risking the loss of valid solutions. The result implies SAT ∉ P and, due to its NP-completeness, that P ≠ NP.</p> |
| title | A Formal Proof That P ≠ NP via SAT Space Irreducibility |
| topic | P vs NP, SAT, Computational Complexity, Structural Proof, Deterministic Turing Machine |
| url | https://doi.org/10.5281/zenodo.15385363 |