Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2025
|
| Subjects: | |
| Online Access: | https://doi.org/10.5281/zenodo.15385363 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of 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>