P-versus-NP problem: Difference between revisions

From Citizendium
Jump to navigation Jump to search
(Created page with "{{subpages}} <!-- Text is transcluded from the BASEPAGENAME/Definition subpage-->")
 
(started)
Line 1: Line 1:
{{subpages}}
{{subpages}}
<!-- Text is transcluded from the BASEPAGENAME/Definition subpage-->
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.

Revision as of 17:03, 13 January 2024

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
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.