Peer-curated academic archive from Georgia Institute of Technology, comprising 1 recorded lecture in Algorithms & Theoretical CS.
Self-contained research seminars, public lectures, and invited colloquia.
Examine the computational complexity of linear optimization over convex bodies, presenting nearly quadratic lower bounds for randomized algorithms in the membership oracle model.
Professors, researchers, and invited lecturers recorded at Georgia Institute of Technology.
Browse, filter, and sort every lecture from Georgia Institute of Technology.
