CSE630
| Course | CSE630 |
| Title | Theory of Computational Complexity |
| Description |
Machine-based polynomial-time complexity theory, including nondeterministic computation, probabilistic computation, time and space tradeoff, and complexity hierarchy; applications to related areas such as combinatorial algorithms and cryptography. |
| Prerequisite |
CSE 540 or CSE 548 |
| Credits | 3 - credits |
| Course Outcomes | |
| Textbook | |
| Course Webpage |
|