P-versus-NP problem: Difference between revisions
Jump to navigation
Jump to search
John Leach (talk | contribs) (started) |
mNo edit summary |
||
| 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. | 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.[[Category:Suggestion Bot Tag]] | ||
Latest revision as of 11:01, 30 September 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.