CS 170: Efficient Algorithms and Intractable Problems (Spring 2012, UC Berkeley). Instructors: Prof. Christos Papadimitriou and Prof. Satish Rao.
FREE
This course includes
Hours of videos
611 years
Units & Quizzes
22
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
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.
Course Currilcum
- Lecture 01 Unlimited
- Lecture 02 Unlimited
- Lecture 03 Unlimited
- Lecture 04 Unlimited
- Lecture 06 Unlimited
- Lecture 07 Unlimited
- Lecture 08 Unlimited
- Lecture 09 Unlimited
- Lecture 10 Unlimited
- Lecture 11 Unlimited
- Lecture 12 Unlimited
- Lecture 13 Unlimited
- Lecture 14 Unlimited
- Lecture 16 Unlimited
- Lecture 17 Unlimited
- Lecture 18 Unlimited
- Lecture 19 Unlimited
- Lecture 22 Unlimited
- Lecture 23 Unlimited
- Lecture 24 Unlimited
- Lecture 25 Unlimited
- Lecture 26 Unlimited
