A Problem in Power Sets Shows P Does Not Equal NP

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

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 deepest and most challenging problems in contemporary mathematics and theoretical computer science. In this article we show P does not equal NP using power sets.

Article activity feed

  1. Version published to 10.20944/preprints202503.1321.v2
  2. Version published to 10.20944/preprints202503.1321.v1