P-versus-NP problem/Definition

From Citizendium
< P-versus-NP problem
Revision as of 06:09, 18 August 2010 by 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...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is a stub and thus not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
https://en.citizendium.org/wiki/index.php?title=P-versus-NP_problem/Definition&printable=yes
A definition or brief description of P-versus-NP problem.

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.

Retrieved from "https://citizendium.org/wiki/index.php?title=P-versus-NP_problem/Definition&oldid=746973"