Sciweavers

STOC
2010
ACM

Towards Polynomial Lower Bounds for Dynamic Problems

14 years 1 months ago
Towards Polynomial Lower Bounds for Dynamic Problems
We consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require n(1) time per operation, unless 3SUM has strongly subquadratic algorithms. Our result is modular:
Mihai Patrascu
Added 01 Mar 2010
Updated 02 Mar 2010
Type Conference
Year 2010
Where STOC
Authors Mihai Patrascu
Comments (0)