A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies
Examine the computational complexity of linear optimization over convex bodies, presenting nearly quadratic lower bounds for randomized algorithms in the membership oracle model.
Theory & AlgosAlgorithms & Data StructuresComputational Complexitycomputational geometryoptimization
Computer Science/Discrete Mathematics Seminar I
11:00am|West Lecture Hall and Remote Access
Topic: A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model
Speaker: Santosh Vempala
Comments
Add a comment...Sign in