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:

• Type: Conference
• Year: 2010
• Where: STOC
• Authors: Mihai Patrascu
• Keywords: Algorithms, Dynamic Problems, Poly-logarithmic Upper Bounds, STOC 2010