Randomized Algorithms (4.0 units)
Standard techniques in the design and analysis of randomized algorithms and random structures. Topics include tail bounds, Markov Chains, VC-dimension, probabilistic method. Prerequisite: CSCI 570 or CSCI 670. Recommended preparation: Basic background in probability and linear algebra.
- Prerequisite: 1 from (CSCI 570 or CSCI 670)
- Crosslist: This course is offered by the CSCI department but may qualify for major credit in ISE. To register, enroll in CSCI 671.
|29972D||048||Lecture||10:00-11:50am||Mon, Wed||16 of 25||David Kempe||KAP141|