8.2      I don't thank rand() < RAND_MAX / (h->N + 1) gives uniformly
         random coin flips even if rand() is uniform

?? 18.3     cyccle -> cycle

?? 19.20    log V and log E are the same up to constant factors, so
         why distinguish here?

23       Need a slide on LP duality!

?? 23.4     Historically "PROGRAMMING" refers to planning.
         MODELING seems more in tune with formulate the *in*equalities

23.9     objective function coefficients should not all be {0, 1}
23.9     z not used much - leads to degenerate basis
23.9     which is your standard form Ax = b or Ax <= b, min or max

23.10    set basic variables to RHS
23.10    corresponds to a simplex vertex -> corresponds to a vertex of polyhedron
23.10    pivot step wrong (there aren't even any fractions!)
23.19    adjacent simplex vertex -> "adjacent" vertex

23.11    start at some simplex vertex -> start at some vertex

23.13    Description of NP-hard is messed up. NP-hard problem
         might not be poly-time solvable even if P = NP.
         A problem L is NP-hard if there is a polynomial-time
         reduction from every probelm in NP to L.


-------
Dynamic Programming

23.4     LINEAR running time *in magnitude of numbers* but
         not their size

23.10    time proportional to N x C  *but not linear in input size*
         NP-hard