P-versus-NP problem/Definition: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

27 July 2023

18 August 2010

  • curprev 07:0907:09, 18 August 2010imported>Peter Schmitt 246 bytes +246 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...