P=NP
Computational Complexity
2007-05-23 v1 Artificial Intelligence
Abstract
We claim to resolve the P=?NP problem via a formal argument for P=NP.
Cite
@article{arxiv.cs/0406056,
title = {P=NP},
author = {Selmer Bringsjord and Joshua Taylor},
journal= {arXiv preprint arXiv:cs/0406056},
year = {2007}
}
Related papers
View all related →
Computational Complexity · Computer Science
Solution of the Linear Ordering Problem (NP=P)
Givi Bolotashvili
2007-05-23
Representation Theory · Mathematics
The Quiver Problem is NP Complete
Victor Kac, Bangzheng Li
2025-08-06
Computational Complexity · Computer Science
Transforming NP to P: An Approach to Solve NP Complete Problems
Wenhong Tian, GuoZhong Li, Xinyang Wang, Qin Xiong +1
2015-05-04
Logic · Mathematics
We must know -- We shall know
Jacob Zimbarg Sobrinho
2020-04-21
Computational Complexity · Computer Science
A Proof for P =? NP Problem
Changlin Wan, Zhongzhi Shi
2020-07-02
Computational Complexity · Computer Science
Exploring P versus NP
Jian-Gang Tang
2024-03-26
Computational Complexity · Computer Science
$P\not=NP$ relative to a $P$-complete oracle
Reiner Czerwinski
2023-05-04
Computational Complexity · Computer Science
Complexity Results of Persuasion
Alban Grastien
2025-07-09
Other Computer Science · Computer Science
P vs NP Problem in the field anthropology
Michael A. Popov
2009-04-21
General Literature · Computer Science
Philosophical Solution to P=?NP: P is Equal to NP
Steven Meyer
2016-03-22
Computational Complexity · Computer Science
The Problem of Computational Complexity
Rami Zaidan
2023-12-25
Computational Complexity · Computer Science
The P versus NP Brief
Mikael Franzen
2009-05-01
Computational Complexity · Computer Science
Generic case completeness
Alexei Miasnikov, Alexander Ushakov
2016-06-06
Quantum Physics · Physics
A stochastic limit approach to the SAT problem
Luigi Accardi, Masanori Ohya
2007-05-23
Computational Complexity · Computer Science
Proofs of NP = coNP = PSPACE: Current upgrade
Lev Gordeev, Edward Hermann Haeusler
2026-05-14
Computational Complexity · Computer Science
A Solution to the P versus NP Problem
Frank Vega Delgado
2014-07-08
Computational Complexity · Computer Science
P is a proper subset of NP
Jerrald Meek
2008-09-07
General Mathematics · Mathematics
An elementary proof that P =/= NP
Bhupinder Singh Anand
2007-05-23
Computational Complexity · Computer Science
How NP got a new definition: a survey of probabilistically checkable proofs
Sanjeev Arora
2008-12-15
Computational Complexity · Computer Science
A "Proof" of $P\neq NP$
Tianrong Lin
2021-10-15
Computational Complexity · Computer Science
Postulate-based proof of the P != NP hypothesis
O. V. German
2020-11-06
Quantum Physics · Physics
A Quantum NP Solver: NP in QP
Thomas L. Clarke
2012-01-19
Computational Complexity · Computer Science
A Critique of "Solving the P/NP Problem Under Intrinsic Uncertainty", arXiv:0811.0463
Andrew Keenan Richardson, Cole Arthur Brown
2009-04-27
Functional Analysis · Mathematics
Solution of the Ovals problem
Yacine Chitour, Jochen Denzler, Frédéric Jean, Emmanuel Trélat
2025-04-22
Computational Complexity · Computer Science
A theory of NP-completeness and ill-conditioning for approximate real computations
Gregorio Malajovich, Mike Shub
2020-05-05