P-versus-NP problem/Definition

From Citizendium
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  [?]
 
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.