The current webpage for this course is:

Note from the first month…
Homework is worth very little, but is highly recommended to complete to prepare for the 3 midterms and 1 final, which is the bulk of your grade. There is also one python project, which counts for 10%. The homeworks are in words where you describe an algorithm, and then write pseudo-code for it.

Math background is helpful, as is a previous undergrad algorithms course. Math covered so far (up to the first exam) includes modular arithmetic, matrix multiplication, complex numbers and polynomial multiplication (FFTs).

The book is very helpful to read combined with the lectures []. If you want to prepare, just start watching the lectures/reading the book.

This course was formerly listed as:
CS 6505 Computability, Complexity, & Algorithms

Per the professor's advice, the version of CS8803-GA run in Spring 2017 will likely be identical to the version of CS6505 run in Fall 2016. Resources on that page should be helpful in preparing.

This is the oncampus version of 6505 which will theoretically be what will be offered as 8803 GA.