{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreic3hurfor6qkgw2jmp22n4zbqqvcxn5kuklje2h2itpuduedagrwe",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mephfbithwa2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2602.10991v1",
  "publishedAt": "2026-02-12T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Changryeol Lee"
  ],
  "textContent": "**Authors:** Changryeol Lee\n\nWhile prior work established a verifier-based polynomial time framework for NP, explicit deterministic machines for concrete NP-complete problems have remained elusive. In this paper, we construct fully specified deterministic Turing Machines (DTMs) for SAT and Subset-Sum within a polynomial-time NP verifier simulation framework. We show that both machines operate in polynomial time and, for satisfiable instances, deterministically generate valid witnesses, thereby extending the framework to deterministic FNP computation without increasing the degree of polynomial complexity. Furthermore, we provide a complete implementation of the framework, including the dynamic computation graph, feasible-graph construction, verification walks, and Turing-machine simulation via edge extensions. The implementation behaves in accordance with the predicted polynomial-time bounds. To ensure transparency and reproducibility, the complete Python implementation and source code are made available in a public online repository.",
  "title": "Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework"
}