SpiceQA
Questions Tags Users Badges

p-np

4 Questions
Newest Active Unanswered Frequent
Score
View
Card Compact
NP-hard problems that are not NP-complete are harder?
user_4602080
• asked Sep 28, 2010
31
6
26060
p-np computer-science complexity-theory
Why are NP problems called that way (and NP-hard and NP-complete)?
user_4249520
• asked Sep 8, 2010
20
5
3877
p-np computer-science complexity-theory
Explain the proof by Vinay Deolalikar that P != NP
user_617930
• asked Aug 9, 2010
67
7
18225
proof p-np computer-science math complexity-theory
What's "P=NP?", and why is it such a famous question?
raldi_75980
• asked Sep 21, 2008
263
6
148689
p-np np-complete computer-science theory complexity-theory
  • 1 (current)
Hot Questions
Terms of service Privacy policy
Powered by Answer