Lower bounds for dynamic algebraic problems

Information and Computation

Volumn 171, Issue 2, 2001, Pages 333-349

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

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVOLUTION; FOURIER TRANSFORMS; INVERSE PROBLEMS; MATRIX ALGEBRA; POLYNOMIALS; RANDOM ACCESS STORAGE; VECTORS;

LOWER BOUNDS;

COMPUTATIONAL METHODS;

EID: 0035895138     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3046     Document Type: Article

References (28)

1. Andersson, A., Hagerup. T., Nilsson, S., and Raman, R. (1995), Sorting in linear time? in "Proc. 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), in "Proc. 32nd Annual Symposium on Foundations of Computer Science," pp. 622-631.
3. Ben-Amram, A. M., and Galil, Z. (1992), On pointers versus addresses, J. Assoc. Comput. Mach. 39, 617-648.
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.
6. Fredman, M. L., Komlòs, J., and Szemerédi, E. (1984), Storing a sparse table with O(1) worst case access time, J. Assoc. Comput. Mach. 31, 538-544.
7. Fredman, M. L. (1981), Lower bounds on the complexity of some optimal data structures, SIAM J. Comput. 10, 1-10.
8. Fredman, M. L. (1982), The complexity of maintaining an array and computing its partial sums, J. Assoc. Comput. Math. 29, 250-260.
9. Fredman, M. L., and Saks, M. E. (1989), The cell probe complexity of dynamic data structures, in "Proc. Twenty First Annual ACM Symposium on Theory of Computing," pp. 345-354.
10. Fredman, M. L., and Willard, D. E. (1993), Surpassing the information-theoretic bound with fusion trees, J. Comput. System Sci. 47, 424-436.
11. Fredman, M. L., and Willard, D. E. (1994), Trans-dichotomous algorithms for mimimum spanning trees and shortest paths. J. Comput. System Sci. 48, 533-551.
12. Hagerup, T. (1998), Sorting and searching on the Word RAM, in "Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 1373, pp. 366-398, Springer-Verlag, Berlin.
13. Hampapuram, H., and Fredman, M. L. (1993), Optimal bi-weighted binary trees and the complexity of maintaining partial sums, in "Proc. 34th Annual Symposium on Foundations of Computer Science," pp. 480-485.
14. Hardy, G. H., and Wright, E. M. (1954), "An Introduction to the Theory of Numbers," 3rd ed., Oxford Univ. Press, London.
15. Hungerford, T. W. (1974), "Algebra," Graduate Texts in Mathematics, Vol. 73, Springer-Verlag, Berlin.
16. Kushilevitz, E., and Nisan, N. (1997), "Communication Complexity," Cambridge Univ. Press, Cambridge, UK.
17. Meshulam, R. (1984), A geometric construction of a superconcentrator of depth 2, Theoret. Comput. Sci. 32, 215-219.
18. Miltersen, P. B. (1994), Lower bounds for Union-Split-Find related problems on random access machines, in "Proc. Twenty-Sixth Annual ACM Symposium on the Theory of Computing," pp. 625-634.
19. Miltersen, P. B., Nisan, N., Safra, S., and Wigderson, A. (1998), On data structures and asymmetric communication complexity, J. Comput. System Sci. 57, 37-49.
20. Paul, W., and Simon, J. (1982), Decision trees and random access machines, in "Logic and Algorithmics," Monograph, Vol. 30, pp. 331-340, Enseign. Math., Univ. Genève, Genèva.
21. Radhakrishnan, J., and Ta-Shma, A. (1997), Tight bounds for depth-two superconcentrators, in "Proc. 38th Annual Symposium on Foundations of Computer Science," pp. 585-594.
22. Reif, J. H., and Tate, S. R. (1997), On dynamic algorithms for algebraic problems, J. Algorithms 22, 347-371.
23. Savage, J. E. (1974), An algorithm for the computation of linear forms, SIAM J. Comput. 3, 150-158.
24. Schwartz, J. T. (1980), Fast probabilistic algorithms for verification of polynomial identities, J. Assoc. Comput. Mach. 27, 701-717.
25. Shafarevich, I. R. (1994), "Basic Algebraic Geometry. 1," 2nd ed., Springer-Verlag, Berlin, Varieties in projective space, translated from the 1988 Russian edition and with notes by Miles Reid.
26. Winograd, S. (1967), On the number of multiplications required to compute certain functions, Proc. Nat. Acad. Sci. U.S.A. 58, 1840-1842.
27. Winograd, S. (1970), On the number of multiplications necessary to compute certain functions, Comm. Pure Appl. Math. 23, 165-179.
28. Yao, A. C. (1985), On the complexity of maintaining partial sums, SIAM J. Comput. 14, 277-288.