Clay Millenium Problem: P = Np

Abstract

The equation P = NP concerns algorithms for deciding membership in sets. The consensus is that P ≠ NP, although some prominent experts guess otherwise.

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,551

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

A Class of Examples Demonstrating That 'P ≠ NP' in the 'P Vs NP' Problem.Vasil Penchev - 2020 - Computing Methodology eJournal (Elsevier: SSRN) 3 (19):1-19.
P ≠ NP for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.
The Philosophical Ontological Proof for P=NP.Alan T. Ho - manuscript
Consequences of the Provability of NP ⊆ P/poly.Stephen Cook & Jan Krajíček - 2007 - Journal of Symbolic Logic 72 (4):1353 - 1371.
An Argument for P = NP.Selmer Bringsjord - 2017 - Minds and Machines 27 (4):663-672.
Fuzzy Time & NP Hardness (P*=BPP*, P*≠NP*).Farzad Didehvar - manuscript
P≠NP, By considering time as a fuzzy concept.Didehvar Farzad - manuscript
Inequality in the Universe, Imaginary Numbers and a Brief Solution to P=NP? Problem.Mesut Kavak - manuscript
Fast-Growing Functions and the P vs. NP Question.Francisco Doria - 2007 - Logic Journal of the IGPL 15 (5-6):445-455.
TC+CON(TC*) deduce P is not equal to NP.Didehvar Farzad - manuscript

Analytics

Added to PP
2010-12-22

Downloads
145 (#155,940)

6 months
145 (#31,626)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references