Efficient Algorithms and Intractable Problems
UC Berkeley,, Spring 2015 , Prof. Prasad Raghavendra
Added to favorite list
Updated On 02 Feb, 19
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
4.1 ( 11 )
Computer Science 170, 001 - Spring 2015
Efficient Algorithms and Intractable Problems - Prasad Raghavendra, Christos H Papadimitriou
Creative Commons 3.0 Attribution-NonCommercial-NoDerivs
Sep 12, 2018
Excellent course helped me understand topic that i couldn't while attendinfg my college.
March 29, 2019
Great course. Thank you very much.