Computer Science 277
| Title | Concrete Complexity |
|---|---|
| Units | 2 |
| Description | The study of inherent complexity of specific computational problems. Circuit complexity, branching programs, decision tree models, sorting and selection, evasive graph properties, algebraic complexity, communication complexity, VLSI complexity, time/space trade-offs. |
| Sections | Instructor | Teaching Effectiveness | How worthwhile was this course? |
|---|---|---|---|
| Fall 1996 | Uri Zwick | ||
| Fall 1992 | Richard M. Karp | ||
| Overall Rating | Teaching Effectiveness | How worthwhile was this course? | |