P-versus-NP problem

From Citizendium
Revision as of 11:01, 30 September 2024 by Suggestion Bot (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is a stub and thus not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
https://en.citizendium.org/wiki/index.php?title=P-versus-NP_problem&printable=yes
This editable Main Article is under development and subject to a disclaimer.

The P-versus-NP problem is a major unsolved problem in theoretical computer science. Basically, the issue is if every problem whose solution can be quickly verified can also be quickly solved.

Retrieved from "https://citizendium.org/wiki/index.php?title=P-versus-NP_problem&oldid=983872"