Independent researcher
Polynomial-Time logic for NP-complete problems,(Subset Sum and P vs NP).
DOI:10.6084/m9.figshare.29613809
DOI:10.17605/osf.io/98NM4
-
20:43
(UTC -12:00) - https://doi.org/10.5281/zenodo.16282799
- https://orcid.org/0009-0009-0154-0918
Popular repositories Loading
-
P-VS-NP-SUBSET-SUM
P-VS-NP-SUBSET-SUM Public templateAn structured attempt at a Polynomial -Time Solution to the NP-complete Subset Sum Problem.
TeX
-
A-Polynomial-Time-Heuristic-for-the-Travelling-Salesman-Problem-Verified-Against-Held-Karp
A-Polynomial-Time-Heuristic-for-the-Travelling-Salesman-Problem-Verified-Against-Held-Karp PublicThis is a polynomial-time structural beam algorithm for the TSP problem, Verified against Held–Karp up to n=15 & stress-tests up to n=100, this shows cubic-time and sub-quadratic memory growth. Res…
TeX
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.