[WPI] [cs2223] [cs2223 text] [News] [Syllabus] [Classes]
In this class we discussed the concept of complexity. Inparticular, we looked at examples of problems which are NP-Complete. That means they cannot be sovled in polynomial time - there is no finite k such that the order of the algorithm is O(nk). Proving that a problem is NP-Complete is important in some areas, such as cryptography, where we depend on a problem being intrinsically hard to solve.
![[WPI Home Page]](../../images/wpi_logo_small.gif){kind=logo} |
![[cs2223 home page]](../../images/cs2223_logo_small.gif){kind=logo} [cs2223 text] [News] [Syllabus] [Classes] |