Skip to search formSkip to main contentSkip to account menu

P versus NP problem

Known as: P/=NP, P/NP Problem, P vs. NP problem 
The P versus NP problem is a major unsolved problem in computer science. Informally speaking, it asks whether every problem whose solution can be… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Berman–Hartmanis conjectureCertificate (complexity)Co-NPComputational complexity theory

Broader (2)

Mathematical optimizationStructural complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Towards Fast Computation of Certified Robustness for ReLU Networks
Verifying the robustness property of a general Rectified Linear Unit (ReLU) network is an NP-complete problem [Katz, Barrett… 
2015
2015
Solution of P versus NP Problem
The P versus NP problem is one of the most important and unsolved problems in computer science. This consists in knowing the… 
Review
2014
Review
2014
The P versus NP Problem in Quantum Physics
Motivated by the fact that information is encoded and processed by physical systems, the P versus NP problem is examined in terms… 
Highly Cited
2010
Highly Cited
2010
The P versus NP Problem
Removed by arXiv administration. This article was plagiarized directly from Stephen Cook's description of the problem for the… 
Highly Cited
2010
Highly Cited
2010
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of… 
Highly Cited
2006
Highly Cited
2006
Effect of plant growth-promoting bacteria and soil compaction on barley seedling growth, nutrient uptake, soil properties and rhizosphere microflora
Inoculants are of great importance in sustainable and/or organic agriculture. In the present study, plant growth of barley… 
2004
2004
The P Versus NP Problem Through Cellular Computing with Membranes
We study the P versus NP problem through membrane systems. Language accepting P systems are introduced as a framework allowing us… 
2004
2004
P Versus NP Problem
The P versus NP problem is the determination of whether all NP-problems are actually P-problems. If P and NP are not equivalent… 
Highly Cited
2003
Highly Cited
2003
The importance of the P versus NP question
The P versus NP problem is to determine whether every language accepted by some nondeterministic Turing machine in polynomial… 
Highly Cited
2001
Highly Cited
2001
Earnings Quality and Stock Returns
An exclusive focus on bottom-line income misses important information about the quality of earnings. Accruals (the difference… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)