Computer Science 170
Title | Efficient Algorithms and Intractable Problems |
---|---|
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. |
Course Guide | Course Guide |