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

Computer Science 170, 001 - Spring 2015 Efficient Algorithms and Intractable Problems - Prasad Raghavendra, Christos H Papadimitriou Creative Commons 3.0 Attribution-NonCommercial-NoDerivs