Complexity Classes
Problems in Computer Science …
- some have polynomial worst-case performance (e.g. n2)
- some have exponential worst-case performance (e.g. 2n)
Classes of problems:
- P = problems for which an algorithm can compute answer in polynomial time
- NP = includes problems for which no P algorithm is known
Beware: NP stands for "nondeterministic, polynomial time (on a theoretical Turing Machine)"
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}