Three Problems in Graph Imbedding to Show<em> P</em> Does Not Equal <em>NP</em>

  1. R. Dharmarajan
  2. D. Ramachandran
Read the full article See related articles

Discuss this preprint

Start a discussion What are Sciety discussions?

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

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.

Article activity feed

  1. Version published to 10.20944/preprints202602.1776.v1