NP complexity class/Definition
Jump to navigation
Jump to search
Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time.
 |
Main Article |
Discussion |
Related Articles [?]
|
Bibliography [?]
|
External Links [?]
|
Citable Version [?]
|
||||||||||||||
|
| ||||||||||||||||||||
Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time.