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 23, 2013)
Randomness and Computation  --  Computer Science (Engineering) (COMPSCI) 271 [3 units]
Course Format: Three hours of lecture per week.
Prerequisites: 170 and at least one course numbered 270-279.
Description: Computational applications of randomness and computational theories of randomness. Approximate counting and uniform generation of combinatorial objects, rapid convergence of random walks on expander graphs, explicit construction of expander graphs, randomized reductions, Kolmogorov complexity, pseudo-random number generation, semi-random sources.
Sinclair
 
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