P-versus-NP problem: Difference between revisions
Jump to navigation
Jump to search
John Leach (talk | contribs) (Created page with "{{subpages}} <!-- Text is transcluded from the BASEPAGENAME/Definition subpage-->") |
John Leach (talk | contribs) (started) |
||
| Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
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. | |||
Latest revision as of 17:03, 13 January 2024
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.