论文信息 - Simplified Lower Bounds for Polynomials with Algebraic Coefficients - 字舞流文

Simplified Lower Bounds for Polynomials with Algebraic Coefficients

We present a very simple method to prove lower bounds for the nonscalar complexity of polynomials with algebraic coefficients.

Walter Baur | W. Baur

[1] Joos Heintz,et al. Lower Bounds for Polynomials with Algebraic Coefficients , 1980, Theor. Comput. Sci..

[2] Joos Heintz,et al. On the Intrinsic Complexity of Elimination Theory , 1993, J. Complex..

[3] Volker Strassen,et al. Polynomials with Rational Coefficients Which are Hard to Compute , 1974, SIAM J. Comput..

[4] Larry J. Stockmeyer,et al. On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials , 1973, SIAM J. Comput..

[5] C.P. Schnorr. Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials , 1978, Theor. Comput. Sci..

[6] Joachim von zur Gathen,et al. Some Polynomials that are Hard to Compute , 1980, Theor. Comput. Sci..

[7] N. Jacobson,et al. Basic Algebra I , 1976 .