Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 239,046,356 papers from all fields of science
Search
Sign In
Create Free Account
P versus NP problem
Known as:
P/=NP
, P/NP Problem
, P vs. NP problem
Expand
The P versus NP problem is a major unsolved problem in computer science. Informally speaking, it asks whether every problem whose solution can be…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Berman–Hartmanis conjecture
Certificate (complexity)
Co-NP
Computational complexity theory
Expand
Broader (2)
Mathematical optimization
Structural complexity theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Two theorems about the P versus NP problem
Tianheng Tsui
arXiv.org
2018
Corpus ID: 19201059
Two theorems about the P versus NP problem be proved in this article (1) There exists a language $L$, that the statement $L \in…
Expand
2016
2016
The P Versus NP Problem. Refutation.
Petr E. Pushkarev
2016
Corpus ID: 123820347
In the article we provides an response to the problem of equality of P and NP classes, which is also called the Millennium…
Expand
2015
2015
Solution of P versus NP problem
M. Hamidi
2015
Corpus ID: 115807631
This paper, taking Travelling Salesman Problem as our object, wishes to develop a constructive algorithm to prove P=NP. Our…
Expand
2011
2011
The Complexity of 3SAT_N and the P versus NP Problem
Ruijia Liao
arXiv.org
2011
Corpus ID: 3200407
We introduce the NP-complete problem 3SAT_N and extend Tovey's results to a classification theorem for this problem. This theorem…
Expand
2011
2011
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty
Yuichi Asahiro
,
J. Jansson
,
Eiji Miyano
,
H. Ono
Computing: The Australasian Theory Symposium
2011
Corpus ID: 2313342
Given an undirected graph G = (V, E), a graph orientation problem is to decide a direction for each edge so that the resulting…
Expand
2006
2006
P versus NP question
D Wisniewski
2006
Corpus ID: 17211513
Many important problems like 3-SAT, Clique, Vertex cover, Travelling Salesman’s problem, etc. have only exponential time…
Expand
2006
2006
Approximability and Computational Feasibility of Dodgson's Rule
A. Slinko
,
G. Pritchard
2006
Corpus ID: 123484635
Condorcet1 proposed that a winner of an election is not legitimate unless a majority of the population prefer that alternative to…
Expand
2000
2000
The P versus NP Problem
Stephen A. Cook
2000
Corpus ID: 267816697
The P versus NP problem is to determine whether every language accepted by some nondeterministic algorithm in polynomial time is…
Expand
1990
1990
Complexity Cores and Hard Problem Instances
Uwe Schöning
SIGAL International Symposium on Algorithms
1990
Corpus ID: 29593832
Many intractable problems such as NP-complete problems (provided P≠NP) have easy subproblems. In contrast, we investigate the…
Expand
1986
1986
Decision Aiding Dangers: The Law of the Hammer and Other Maxims
G. Hopple
IEEE Transactions on Systems, Man and Cybernetics
1986
Corpus ID: 37618260
The potential dangers of decision aiding in the realm of computer-based command and control (C2) problem-solving systems are…
Expand