Lower bounds on the bounded coefficient complexity of bilinear maps

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 659-668

  Bürgisser, Peter ^a   Lotz, Martin ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; CONVOLUTION; DIGITAL ARITHMETIC; LINEAR EQUATIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES; THEOREM PROVING;

BILINEAR MAPS; BOUNDED COEFFICIENT COMPLEXITY; COEFFICIENT ARITHMETIC CIRCUITS; CYCLIC CONVOLUTION; LOWER BOUNDS; RANDOM CIRCULANT MATRIX;

COMPUTER SCIENCE;

EID: 0036957875     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Bellman. Introduction to matrix analysis. SIAM, Philadelphia, PA, 1997.
2. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic complexity theory, Springer-Verlag, Berlin, 1997.
3. B. Chazelle. A spectral approach to lower bounds with applications to geometric searching. SIAM Journal on Computing, 27(2):545-556, 1998.
4. R. Courant and D. Hilbert. Methoden der mathematischen Physik. I. Springer-Verlag, Berlin, 1931, Zweite Auflage.
5. G. H. Golub and C. Van Loan. Matrix Computations. The John Hopkins University Press, Baltimore, 1996.
6. H. T. Kung. On computing reciprocals of power series. Numer. Math., 22:341-348, 1974.
7. S. Lang. Algebra, Addison-Wesley, second edition, 1984.
8. S. Lokam. Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity. In Proc. 36th FOCS, pages 6-15, 1995.
9. J. Morgenstern. Note on the lower bound of the linear complexity of the fast fourier transform. Journal of the ACM, 20:305-306, 1973.
10. J. Morgenstern. The linear complexity of computation. J. ACM, 22:184-194, 1975.
11. N. Nisan and A. Wigderson. On the complexity of bilinear forms. Proc. of the 27th ACM Symposium on the Theory of Computing, pages 723-732, 1995.
12. P. Pudlák. A note on the use of determinant for proving lower bounds on the size of linear circuits. ECCC Report, 42, 1998.
13. R. Raz. On the complexity of matrix product. In Proc. 34th STOC, 2002. Also available as ECCC Report 12, 2002.
14. M. Sieveking. An algorithm for division of power series. Computing (Arch. Elektron. Rechnen), 10:153-156, 1972.
15. V. Strassen. Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten. Num. Math., 20:238-251, 1973.
16. V. Strassen. Vermeidung von Divisionen, Crelles J. Reine Angew. Math., 264:184-202, 1973.
17. L. Valiant. Graph theoretic properties in computational complexity. J. Comput. Syst. Sci., 13:278-285, 1976.
18. L. Valiant. Graph theoretic arguments in low-level complexity. Number 53 in Lecture Notes in Computer Science, pages 162-176, Springer, 1977.