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