 |
 |
|
 |
 |
|
|
|
|
|
|
Top :
Computers :
Computer Science :
Theoretical :
Complexity Theory |
| The study of algorithmic complexity. A topic of particular interest is the relationship between polynomial-time (P) and non-deterministic polynomial-time (NP), the latter consisting of algorithms for which there is a P solution given the right initial guess (often called witness or certificate). |
|
|
|
| © 2008 Chamas Enterprises Inc. |
