Towards polynomial lower bounds for dynamic problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 603-609

  Pǎtraşcu, Mihai ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

3SUM; dynamic data structures; lower bounds

Indexed keywords

COMBINATORIAL PROBLEM; DISJOINTNESS; DYNAMIC DATA STRUCTURE; DYNAMIC PROBLEM; HARDNESS RESULT; LOWER BOUNDS; SUBQUADRATIC ALGORITHMS; UPPER BOUND;

DATA STRUCTURES; HARDNESS;

COMPUTATION THEORY;

EID: 77954741518     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806772     Document Type: Conference Paper

References (32)

1. N. Ailon and B. Chazelle. Lower bounds for linear degeneracy testing. In Proc. 36th ACM Symposium on Theory of Computing (STOC), pages 554-560, 2004.
2. I. Baran, E. D. Demaine, and M. Pǎtraşcu. Subquadratic algorithms for 3SUM. Algorithmica, 50(4):584-596, 2008.
3. See also WADS 2005.
4. G. Barequet and S. Har-Peled. Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard. In Proc. 10th ACM/SIAM Symposium on Discrete Algorithms (SODA), page 862-863, 1999.
5. T. M. Chan. Dynamic subgraph connectivity with geometric applications. In Proc. 34th ACM Symposium on Theory of Computing (STOC), pages 7-13, 2002.
6. T. M. Chan, M. Pǎtraşcu, and L. Roditty. Dynamic connectivity: Connecting to networks and geometry. In Proc. 49th IEEE Symposium on Foundations of Computer Science (FOCS), pages 95-104, 2008.
7. C. Demetrescu and G. F. Italiano. A new approach to dynamic all pairs shortest paths. Journal of the ACM, 51(6):968-992, 2004.
8. See also STOC'03.
9. 2) barrier. Journal of the ACM, 52(2):147-156, 2005.
10. See also FOCS'00.
11. M. Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In Proc. 13th Symposium on Theoretical Aspects of Computer Science (STACS), pages 569-580, 1996.
12. J. Erickson. Bounds for linear satisfiability problems. Chicago Journal of Theoretical Computer Science, 1999.
13. 2) problems in computational geometry. Computational Geometry: Theory and Applications, 5:165-185, 1995.
14. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), pages 81-91, 1999.
15. V. King and G. Sagert. A fully dynamic algorithm for maintaining the transitive closure. Journal of Computer and System Sciences, 65(1):150-167, 2002.
16. See also STOC'99.
17. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, 1998.
18. See also STOC'95.
19. N. Nisan and A. Wigderson. Rounds in communication complexity revisited. SIAM Journal on Computing, 22(1):211-219, 1993.
20. See also STOC'91.
21. M. Pǎtraşcu and R. Williams. On the possibility of faster sat algorithms. In Proc. 21st ACM/SIAM Symposium on Discrete Algorithms (SODA), 2010. To appear.
22. M. Pǎtraşcu and E. D. Demaine. Logarithmic lower bounds in the cell-probe model. SIAM Journal on Computing, 35(4):932-963, 2006.
23. See also SODA'04
24. STOC'04.
25. L. Roditty and U. Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In Proc. 36th ACM Symposium on Theory of Computing (STOC), pages 184-191, 2004.
26. P. Sankowski. Dynamic transitive closure via dynamic matrix inverse. In Proc. 45th IEEE Symposium on Foundations of Computer Science (FOCS), pages 509-517, 2004.
27. P. Sen and S. Venkatesh. Lower bounds for predecessor searching in the cell probe model. Journal of Computer and System Sciences, 74(3):364-385, 2008.
28. See also ICALP'01, CCC'03.
29. M. A. Soss, J. Erickson, and M. H. Overmars. Preprocessing chains for fast dihedral rotations is hard or even impossible. Computational Geometry, 26(3):235-246, 2003.
30. M. Thorup. Worst-case update times for fully-dynamic all-pairs shortest paths. In Proc. 37th ACM Symposium on Theory of Computing (STOC), pages 112-119, 2005.
31. L. G. Valiant. Graph-theoretic arguments in low-level complexity. In Proc. 6th Mathematical Foundations of Computer Science (MFCS), pages 162-176, 1977.
32. V. Vassilevska and R. Williams. Finding, minimizing, and counting weighted subgraphs. In Proc. 41st ACM Symposium on Theory of Computing (STOC), pages 455-464, 2009.