General Catalog
University of California, Berkeley


Home> Course Search>


Search Results


There were 1 matches to your request:
(from the 2011-2013 General Catalog updated as of  May 16, 2013)
Efficient Algorithms and Intractable Problems  --  Computer Science (Engineering) (COMPSCI) 170 [4 units]
Course Format: Three hours of lecture and one hour of discussion per week.
Prerequisites: 61B, Mathematics 55.
Description: 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.
(F,SP) Demmel, Papadimitriou, Rao, Wagner, Vazirani
 
To the Top


Copyright 2007 UC Regents. All rights reserved. Contact us.
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
General Catalog University of California, Berkeley Undergrad/Grad Education Courses/Curricula by Dept. Course Search Related Sites Get a PDF/Print Catalog