Computer Science 271
| Title | Randomness and Computation |
|---|---|
| Units | 3 |
| Prerequisites | 170 and at least one course numbered 270-279. |
| Description | Computational applications of randomness and computational theories of randomness. Approximate counting and uniform generation of combinatorial objects, rapid convergence of random walks on expander graphs, explicit construction of expander graphs, randomized reductions, Kolmogorov complexity, pseudo-random number generation, semi-random sources. |
| Sections | Instructor | Teaching Effectiveness | How worthwhile was this course? |
|---|---|---|---|
| Fall 2022 | Alistair Sinclair | ||
| Spring 2020 | Alistair Sinclair | ||
| Spring 2018 | Alistair Sinclair | ||
| Fall 2011 | Alistair Sinclair | ||
| Fall 2008 | Alistair Sinclair | ||
| Fall 2005 | Alistair Sinclair | ||
| Fall 2001 | Alistair Sinclair | ||
| Spring 1998 | Alistair Sinclair | ||
| Spring 1996 | Alistair Sinclair | ||
| Spring 1994 | Richard M. Karp | ||
| Spring 1991 | Umesh Vazirani | ||
| Fall 1988 | Umesh Vazirani | ||
| Overall Rating | Teaching Effectiveness | How worthwhile was this course? | |