2.10
| Printed: | asymmetric |
| Corrected: | rename to not transitive |
3.30
| Printed: | on same level |
| Corrected: | on adjacent levels |
3.39
| Printed: | Topological order is misssing edge from v1 to v7. |
| Corrected: | Add edge from v1 to v7. |
4.7
| Printed: | Greedy: i1 i1 |
| Corrected: | Greedy: i1 i2 |
5.36
| Printed: | 110101010 |
| Corrected: | 11010101 and remove first line for add example |
FFT, slide 14
| Printed: | k + n |
| Corrected: | k + n/2 |
6.12
| Printed: | w_j |
| Corrected: | v_j |
6.15
| Printed: | M[j] = 0 |
| Corrected: | M[0] = 0 |
6.18
| Printed: | see p. 288 |
| Corrected: | see p. 304 |
6.39
| Printed: | 5 mismatches, 1 gap |
| Corrected: | 6 mismatches, 1 gap |
7.21 (max flow, min cut)
| Printed: | c(e) > 0 |
| Corrected: | f(e) > 0 |
7.23 (max flow, min cut)
| Printed: | f(e) - b |
| Corrected: | f(e^R) - b |
7.25 (max flow applications)
| Printed: | "4" above "10" |
| Corrected: | remove "4" above "10" |
8.15
| Printed: | Are Cook and Karp reductions the same? |
| Corrected: | Are Cook and Karp reductions the same with respect to NP? |
8.37 (Polynomial Reductions)
| Printed: | 100110, 100001, 10000, 10111, 1101 |
| Corrected: | 100010, 100101, 10100, 10011, 1001 |
9.2
| Printed: | Amy |
| Corrected: | Alice |
9.14
| Printed: | sequence of configurations starting from {C1} |
| Corrected: | start sequence from empty set |
10.8
| Printed: | base case is k = 1 |
| Corrected: | need base case of k = 0 |
10.13
| Printed: | w_v + sum_v Mout[v] |
| Corrected: | w_u + sum_v Mout[v] |
11.5, 11.11
| Printed: | pseudocode |
| Corrected: | needs to return schedule |
11.5
| Printed: | O(n log n) |
| Corrected: | O(n log m) |
11.55
| Printed: | Table of values |
| Corrected: | First 3 values need to have an extra digit |