Remember to enter your CIOS comments for this course and all your courses.
Laszlo Babai's first talk on his new graph isomorphism algorithm is now on video. Babai is an excellent lecturer and I highly recommend finding 100 minutes to watch the talk.
Today we covered time-space tradeoffs for SAT from the papers:
Time-space tradeoffs for satisfiability by L. Fortnow. .
Time-space lower bounds for satisfiability by L. Fortnow, R. Lipton, D. van Melkebeek, and A. Viglas.
