Complexity Classes (cont)
Computer Science jargon for difficulty:
- tractable … have a polynomial-time algorithm (useful in practice)
- intractable … no tractable algorithm is known (feasible only for small n)
- non-computable … no algorithm can exist
Computational complexity theory deals with different degrees of intractability
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}