P != NP question

后端 未结 8 5931
小蘑菇
小蘑菇 2021-02-20 19:04

Not a \'pure\' programming question, but since it is deeply involved in programming theory, I thought it best to ask here.

Regarding the P NP problem, this excerpt from

8条回答
  •  青春惊慌失措
    2021-02-20 19:15

    Essentially, in the set of NP, or Nondeterministic Polynomial time, problems, the answer can be verified in polynomial time. The question is whether all such problems can be determined in polynomial time.

    If P=NP is true, and such algorithms are discovered many problems that are hard to solve but easy to verify the solution, such as proofs, become as easy to solve as to verify.

提交回复
热议问题