Lower bounds for dynamic algebraic problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 362-372

  Frandsen, Gudmund Skovbjerg ^a   Hansen, Johan P ^a   Miltersen, Peter Bro ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONVOLUTION; DISCRETE FOURIER TRANSFORMS; TRANSFER MATRIX METHOD;

ALGEBRAIC COMPUTATIONS; ARITHMETIC COMPUTATIONS; COMMUNICATION COMPLEXITY; ELEMENTARY SYMMETRIC FUNCTIONS; MATRIX MULTIPLICATION; MATRIX-VECTOR PRODUCTS; POLYNOMIAL MULTIPLICATION; STRAIGHT LINE PROGRAM;

INVERSE PROBLEMS;

EID: 22644448605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_34     Document Type: Conference Paper

References (20)

1. Amir M. Ben-Amram and Zvi Galil. Lower bounds for data structure problems on RAMs (extended abstract). In Proc. 32nd Annual Symposium on Foundations of Computer Science, pages 622-631, 1991.
2. Amir M. Ben-Amram and Zvi Galil. On pointers versus addresses. J. Assoc. Comput. Mach, 39:617-648, 1992.
3. M.L. Fredman. Lower bounds on the complexity of some optimal data structures. SIAM J. Comput., 10:1-10, 1981.
4. M.L. Fredman. The complexity of maintaining an array and computing its partial sums. J. Assoc. Comput. Mach., 29:250-260, 1982.
5. M.L. Fredman and M.E. Saks. The cell probe complexity of dynamic data structures. In Proc. Twenty First Annual ACM Symposium on Theory of Computing, pages 345-354, 1989.
6. M.L. Fredman and D.E. Willard. Surpassing the information-theoretic bound with fusion trees. J. Comput. System Sci., 47:424-436, 1993.
7. M.L. Fredman and D.E. Willard. Trans-dichotomous algorithms for mim- imum spanning trees and shortest paths. J. Comput. System Sci., 48:533-551, 1994.
8. th Annual Symposium on Theoretical Aspects of Computer Science, LNCS vol. 1373, pages 366-398. Springer-Verlag, 1998.
9. H. Hampapuram and M.L. Fredman. Optimal bi-weighted binary trees and the complexity of maintaining partial sums. In Proc. 34th Annual Symposium on Foundations of Computer Science, pages 480-485, 1993.
10. Thomas W. Hungerford. Algebra, volume 73 of Graduate Texts in Mathematics. Springer-Verlag, 1974.
11. G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. (Third Edition). Oxford University Press, 1954.
12. Roy Meshulam. A geometric construction of a superconcentrator of depth 2. Theoret. Comput. Sci., 32:215-219, 1984.
13. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. In Proc. 27th Annual ACM Symposium on the Theory of Computing, pages 103-111, 1995.
14. John H. Reif and Stephen R. Tate. On dynamic algorithms for algebraic problems. J. Algorithms, 22:347-371, 1997.
15. Jaikumar Radhakrishnan and Amnon Ta-Shma. Tight bounds for depth-two superconcentrators. In Proc. 38th Annual Symposium on Foundations of Computer Science, pages 585-594, 1997.
16. J.E. Savage. An algorithm for the computation of linear forms. SIAM J. Comput., 3:150-158, 1974.
17. Leslie G. Valiant. Graph-theoretic properties in computational complexity. Journal of Computer and System Sciences, 13(3):278-285, December 1976.
18. S. Winograd. On the number of multiplications required to compute certain functions. Proc. Nat. Acad. Sci. U.S.A., 58:1840-1842, 1967.
19. S. Winograd. On the number of multiplications necessary to compute certain functions. Comm. Pure Appl. Math., 23:165-179, 1970.
20. A.C. Yao. On the complexity of maintaining partial sums. SIAM J. Comput., 14:277-288, 1985.