P-versus-NP problem/Definition: Difference between revisions
Jump to navigation
Jump to search
imported>Peter Schmitt (New page: <noinclude>{{Subpages}}</noinclude> A famous open problem in complexity theory asking whether any decision problem that can be solved by a nondeterministic algorithm in polynomial tim...) |
John Leach (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
<noinclude>{{ | <noinclude>{{subpages}}</noinclude> | ||
A famous open problem in [[complexity theory]] asking whether any decision problem that can be solved by a nondeterministic algorithm in polynomial time can also be solved deterministically in polynomial time. | A famous open problem in [[complexity theory]] asking whether any decision problem that can be solved by a nondeterministic algorithm in polynomial time can also be solved deterministically in polynomial time. | ||
Latest revision as of 15:08, 27 July 2023
A famous open problem in complexity theory asking whether any decision problem that can be solved by a nondeterministic algorithm in polynomial time can also be solved deterministically in polynomial time.