|
Tutoring
Tutoring Schedule
Course Surveys
EE Professors
EE Teaching Assistants
EE Courses
CS Professors
CS Teaching Assistants
CS Courses
Online Exams
HKN Online Exams
More Student Services
Undergraduate Notes
Graduate School Info
CS GRE Review Notes
Industrial Relations
Useful Links
|
| Title | Efficient Algorithms and Intractable Problems |  |
|---|
| Instructors in Charge | Manuel Blum, Alistair Sinclair, Umesh Vazirani |
|---|
| Units | 4 |
|---|
| Prerequisites | 61B, Mathematics 55. |
|---|
| Description | Concept and basic techniques in the design and analysis of algorithms; models of computation; lower bounds; algorithms for optimum search trees, balanced trees and UNION-FIND algorithms; numerical and algebraic algorithms; combinatorial algorithms. Turing machines, how to count steps, deterministic and nondeterministic Turing machines, NP-completeness. Unsolvable and intractable problems. |
|---|
| Exam Files | Available |
|---|
| Newsgroup | ucb.class.cs170 |
|---|
Hint: You can click on the colored rating bars to see detailed statistics on a particular rating.
Powered by GoodProfOrNot.
|