Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
Changryeol Lee
While prior work established a verifier-based polynomial-time framework for NP, explicit deterministic machines for concrete NP-complete problems have remained elusive. In this pap…
cs.CC2025
Graph-Based Deterministic Polynomial Framwork for NP Problems
Changryeol Lee
The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive pro…