Focuses on central concepts in theoretical computer science, including NP-hardness, reductions, approximation algorithms, and fixed parameter algorithms. Samples modern algorithmic topics such as streaming, online, randomized, probabilistic, distributed, and quantum computations. Studies hard computational problems in both combinatorial and geometric settings. Prerequisites: Enrollment is Computer Science MPhD program; or one of the following: B+ or greater in CS 5050, A- or greater in CS 2420, or permission of instructor. Semester Taught: Spring
| Dates | Fall 2020 | 8/31/20 - 12/18/20 |
|---|---|
| Times | T 5:15 PM - 7:45 PM |
| Credits | 3.0 |
| Delivery | Interactive Broadcast |
| Wang, Haitao | haitao.wang@usu.edu |
| Textbooks | View Textbooks |
| Syllabus | Loading... |
| Seats Available | 8 of 20 Available |
| Waitlist Available | 100 of 100 Available |
| Center | CRN | Building (Rooms) |
|---|---|---|
| Logan | 52129 | Huntsman Hall (270) |
| Blanding | 52136 | To Be Determined |
| Brigham City | 52130 | To Be Determined |
| Kaysville | 52132 | To Be Determined |
| Moab | 52131 | To Be Determined |
| Orem | 52133 | To Be Determined |
| Price | 52134 | To Be Determined |
| Salt Lake | 52135 | To Be Determined |
| Southwest * | 52137 | To Be Determined |
| Tooele | 52138 | To Be Determined |
* Not all courses designated "southwest" are available at every Southwest location. Speak with a southwest advisor to confirm availability.