Algorithms, April 2021 at CIS
8-10pm ET on Saturday for first 6 weeks, then 8-11pm ET Saturday
Talk with Liu or Tianrui
Liu Liu and
Design and Analyze Algorithms!
Topics: multiplicative weights, Strassen and Karatsuba, polynomials, convexity, gradient descent
Grading is based on 4 homeworks each worth 8%, an exam worth 18%, a final project worth 40%, and class participation worth 10%
We encourage homework solutions, scribe notes, and final projects to be typeset in LaTeX. If you are not familiar with LaTeX, see this introduction.
Materials from the following course might be useful in various parts of this course:
Undergraduate Algorithms Class at Carnegie Mellon University
Maintained by David Woodruff