Lower Bounds for Dynamic Algebraic Problems-Reference-Cited by-同舟云学术

Lower Bounds for Dynamic Algebraic Problems

Published:2001-12 Issue:2 Volume:171 Page:333-349
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Frandsen Gudmund Skovbjerg,Hansen Johan P,Miltersen Peter Bro

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference28 articles.

1. Andersson, A., Hagerup, T., Nilsson, S., and Raman, R.1995, Sorting in linear time?inProc. Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pp. 427–436.

2. Ben-Amram, A. M., and Galil, Z.1991, Lower bounds for data structure problems on RAMs (extended abstract), inProc. 32nd Annual Symposium on Foundations of Computer Science, pp. 622–631.

3. On pointers versus addresses;Ben-Amram;J. Assoc. Comput. Mach.,1992

4. Buergisser, P, Clausen, M, and, Shokrollahi, M. A. 1997, Algebraic Complexity Theory, Springer-Verlag, Berlin/Heidelberg.

5. Eisenbud, D. 1995, Commutative Algebra, Graduate Texts in Mathematics, Vol, 150, Springer-Verlag, Berlin.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Worst-case to average-case reductions via additive combinatorics;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

2. Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11

3. Updating Matrix Polynomials;Algorithmic Aspects in Information and Management;2019

4. Simulation beats richness: new data-structure lower bounds;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20

5. New Unconditional Hardness Results for Dynamic and Online Problems;2015 IEEE 56th Annual Symposium on Foundations of Computer Science;2015-10