Towards Polynomial Lower Bounds for Dynamic Problems

15 years 12 months ago

Download people.csail.mit.edu

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

Real-time Traffic

Algorithms | Dynamic Problems | Poly-logarithmic Upper Bounds | STOC 2010 |

claim paper

» Nonuniform ACC Circuit Lower Bounds

» Soft car sequencing with colors Lower bounds and optimality proofs

» Improved Recombination Lower Bounds for Haplotype Data

» Inductive TimeSpace Lower Bounds for Sat and Related Problems

» Dynamic normal forms and dynamic characteristic polynomial

» CrossComposition A New Technique for Kernelization Lower Bounds

» TimeSpace Lower Bounds for the PolynomialTime Hierarchy on Randomized Machines

» Quantum lower bounds for the GoldreichLevin problem

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	STOC
Authors	Mihai Patrascu

Comments (0)

Sciweavers

Towards Polynomial Lower Bounds for Dynamic Problems

Algorithms | Dynamic Problems | Poly-logarithmic Upper Bounds | STOC 2010 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers