Complexity measures and hierarchies for the evaluation of integers, polynomials, and n-linear forms
暂无分享,去创建一个
[1] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[2] Volker Strassen,et al. Polynomials with Rational Coefficients Which are Hard to Compute , 1974, SIAM J. Comput..
[3] Larry J. Stockmeyer,et al. On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials , 1973, SIAM J. Comput..
[4] Edmund Landau. Über einige neuere Fortschritte der additiven Zahlentheorie , 1937 .
[5] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .
[6] John E. Savage,et al. An Algorithm for the Computation of Linear Forms , 1974, SIAM J. Comput..
[7] Allan Borodin,et al. On the Number of Additions to Compute Specific Polynomials , 1976, SIAM J. Comput..
[8] I. Niven,et al. An introduction to the theory of numbers , 1961 .
[9] Allan Borodin,et al. On the number of additions to compute specific polynomials (Preliminary Version) , 1974, STOC '74.