## CS170: Efficient Algorithms and Intractable Problems

**CS 170: Efficient Algorithms and Intractable Problems (Spring 2012, UC Berkeley)**. Instructors: Prof. Christos Papadimitriou and Prof. Satish Rao.
This course discusses 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.