| _version_ | 1866901274282164224 |
|---|---|
| author | Kyaw, Kyaw Phone Thar |
| author_facet | Kyaw, Kyaw Phone Thar |
| contents | <p>This document presents MultiScaleSAT, a polynomial-time algorithm for SAT. We provide formal proofs of soundness, completeness, and runtime bounds. This work proposes a constructive resolution to the P = NP problem</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_15960264 |
| institution | Zenodo |
| language | eng |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP Kyaw, Kyaw Phone Thar <p>This document presents MultiScaleSAT, a polynomial-time algorithm for SAT. We provide formal proofs of soundness, completeness, and runtime bounds. This work proposes a constructive resolution to the P = NP problem</p> |
| title | A Polynomial-Time Algorithm for SAT: Constructive Proof that P = NP |
| url | https://doi.org/10.5281/zenodo.15960264 |