Lower bounds for polynomial evaluation and interpolation problems

Computational Complexity

Volumn 6, Issue 4, 1996, Pages 301-311

  Shoup, Victor ^a   Smolensky, Roman ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040240146     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01270384     Document Type: Article

References (9)

1. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading MA, 1974.
2. A. BORODIN AND I. MUNRO, The Computational Complexity of algebraic and numeric Problems. American Elsevier, New York NY, 1975.
3. J. F. CANNY, E. KALTOFEN, AND L. YAGATI, Solving systems of non-linear polynomial equations faster. In Proc. International Symposium on Symbolic and Algebraic Computation, 1989, 121-128.
4. J. FRIEDMAN, Note on matrix rigidity. Combinatorica 13 (1993), 235-239.
5. J. MORGENSTERN, Note on a lower bound of the linear complexity of the Fast Fourier Transform. JACM 20(2) (1973), 305-306.
6. A. A. RAZBOROV, On rigid matrices. Preprint, 1991.
7. V. STRASSEN, Vermeidung von Divisionen. J. reine u. angew. Math. 264 (1973a), 182-202.
8. V. STRASSEN, Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten. Numer. Math. 20 (1973b), 238-251.
9. L. G. VALIANT, Graph-theoretic arguments in low-level complexity. In MFCS 1977, Springer-Verlag LNCS, 1977, 162-176.