Three Problems in Graph Imbedding to Show P Does Not Equal NP
preprint
OA: closed
CC-BY-4.0
Abstract
The P versus NP problem, a conjecture formulated by Stephen Cook in 1971, is one of the most challenging problems in contemporary mathematics and theoretical computer science. A concise mathematical formulation of the problem reads: is P = NP? In longer phrasing, this asks: given a problem instance, if some additional data can be recognized fast enough as logically implying the existence of a solution (to the instance), then can a so- lution be computed fast enough? we formulate three problems in graph imbedding to show P ≠ NP.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.
Source provenance
- europepmc
- last seen: 2026-05-20T01:45:00.602351+00:00
- unpaywall
- last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0