# p-np

##### A 到 B 的减少：对或错(Reduction of A to B : True or False)

2021-10-19 00:31:23    分类:技术分享    algorithm   computation   p-np

##### Reduction of A to B : True or False

There are two statements: If a decision problem A is polynomial-time reducible to a decision problem B (i.e., A≤ pB ), and B is NP-complete, then A must be NP-complete. And: If a decision problem B is polynomial-time reducible to a decision problem A (i.e., B≤ pA ), and B is NP-complete, then A must be NP-complete. Which of the above statements are true? Can you also give explanation?

2021-10-18 14:27:10    分类:问答    algorithm   computation   p-np

##### What are NP problems?

I read the article on wikipedia but could not understand what exactly are NP problems. Can anyone tell me about them and also what is relation of them with P Problems?

2021-07-30 11:13:46    分类:问答    complexity-theory   p-np

##### 解释 Vinay Deolalikar 证明 P != NP [关闭](Explain the proof by Vinay Deolalikar that P != NP [closed])

2021-06-23 07:56:25    分类:技术分享    math   computer-science   complexity-theory   proof   p-np

##### Explain the proof by Vinay Deolalikar that P != NP [closed]

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 4 years ago. Improve this question Recently there has been a paper floating around by Vinay Deolalikar at HP Labs which claims to have proved that P != NP. Could someone explain how this proof works for us less mathematically inclined people?

2021-05-15 05:59:05    分类:问答    math   computer-science   complexity-theory   proof   p-np

##### NP问题为什么这样称呼（以及NP难题和NP难题）？(Why are NP problems called that way (and NP-hard and NP-complete)?)

2021-05-09 06:08:27    分类:技术分享    computer-science   complexity-theory   p-np

##### “Finding all the code in a given binary is equivalent to the Halting problem.” Really?

Was just reading the highly voted question regarding Emulators and the statement It's been proven that finding all the code in a given binary is equivalent to the Halting problem. Really stuck out at me. Surely that can't be true? Isn't it just a large dependency graph? Would be really grateful for some further insight into this statement.

2021-04-27 21:50:07    分类:问答    computer-science   emulation   halting-problem   p-np

##### 什么是“ P = NP？”，为什么它是一个如此著名的问题？ [关闭](What's “P=NP?”, and why is it such a famous question? [closed])

2021-04-20 16:50:45    分类:技术分享    computer-science   theory   complexity-theory   np-complete   p-np

##### Why are NP problems called that way (and NP-hard and NP-complete)?

Really.. I'm having the last test for graduation this Tuesday, and that's one of the things I just never could understand. I realize that a solution for NP problem can be verfied in polynomial time. But what does determinism has to do with that? And if you could explain me where NP-complete and NP-hard got their names, that would be great (I'm pretty sure I get the meaning of them, I just don't see what their names have to do with what they are). Sorry if that's trivial, I just can't seem to get it (-: Thanks all!

2021-04-15 03:20:36    分类:问答    computer-science   complexity-theory   p-np

##### What's “P=NP?”, and why is it such a famous question? [closed]

Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 8 years ago. Improve this question The question of whether P=NP is perhaps the most famous in all of Computer Science. What does it mean? And why is it so interesting? Oh, and for extra credit, please post a proof of the statement's truth or falsehood. :)

2021-04-07 20:03:04    分类:问答    computer-science   theory   complexity-theory   np-complete   p-np