A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model
Researchers prove nearly quadratic lower bounds for linear optimization over convex bodies in the membership oracle model.
1 stories, newest first · one card per story
Researchers prove nearly quadratic lower bounds for linear optimization over convex bodies in the membership oracle model.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views