| Details: |
In-depth discussion of computational complexity theory including models of computation, polynomially bounded, NP-completeness, reducibility, and beyond NP-completeness, and intractable problems. NP-complete problems in various areas will be discussed. |
