Combinatorial Geometry, Learning and Algorithms
Caltech CS101B Section 1, Winter 2009

Leonard J. Schulman

Office hours by appointment (ask in class or send an email)
TA: None
Lectures: MW 2:00-3:25. Location: Jorgensen 287
Units: 3-0-6.

Convexity, transversal theorems, VC dimension, and related topics bridging geometry, combinatorics and computation

Course textbook: Matousek, Lectures on Discrete Geometry. Springer 2002. (On reserve at SFL and available at the campus bookstore.) (Errata.)

Problem sets:

  1. Problem set 1 due Wednesday January 14.
  2. Problem set 2 due Monday January 26.
  3. Problem set 3 due Wednesday February 11 (oral) and Wednesday February 18 (written).
  4. Problem set 4 due Wednesday February 25 (oral) and Monday March 2 (written).
  5. Problem set 5 due Wednesday March 11.