Efficient Algorithms and Intractable Problems

UC Berkeley Course , Spring 2015 , Prof. Prasad Raghavendra

594 students enrolled

Overview

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

Lecture 1:

Up Next
You can skip ad in
SKIP AD >
Advertisement
      • 2x
      • 1.5x
      • 1x
      • 0.5x
      • 0.25x
        EMBED LINK
        COPY
        DIRECT LINK
        PRIVATE CONTENT
        OK
        Enter password to view
        Please enter valid password!
        0:00
        2.8 (5 Ratings)

        Lecture Details

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

        LECTURES



        Review


        2.8

        5 Rates
        5
        20%
        1
        3
        40%
        2
        2
        20%
        1
        1
        20%
        1

        Comments Added Successfully!
        Please Enter Comments
        Please Enter CAPTCHA
        Invalid CAPTCHA
        Please Login and Submit Your Comment