Lecture Notes
Polytopes, their diameter, and randomized simplex
Description:
Summary presentation based on two papers: Kalai, Gil. “A Subexponential Randomized Simplex Algorithm (Extended Abstract).” In Proceedings of the 24th Annual Association for Computing Machinery Symposium on Theory of Computing. New York, NY: ACM Press, 1992.
Resource Type:
Lecture Notes
pdf
284 kB
Polytopes, their diameter, and randomized simplex
Course Info
Instructor
Departments
As Taught In
Fall
2003
Level
Learning Resource Types
notes
Lecture Notes
assignment_turned_in
Presentation Assignments with Examples
