Skip to main content
SpringerLink
Log in

Algorithms for polynomial division

  • Algebraic Algorithms I
  • Conference paper
  • First Online:
EUROCAL '85 (EUROCAL 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 204))

Included in the following conference series:

  • 166 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. D. Bini, Parallel Solution of Certain Toeplitz Linear Systems, SIAM J. Comp. 13, 2, 268–276 (1984), also T.R.B82-04 I.E.I. of C.N.R., Pisa, Italy (April 1982).

    Google Scholar 

  2. D. Bini, V. Pan, Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power Tech. Rep. 84-11, Computer Sci. Dept., SUNY, Albany, NY (1984).

    Google Scholar 

  3. D. Bini, V. Pan, Fast Parallel Algorithms for Polynomial Division over Arbitrary Fields of Constants, Nota Interna, Dept. of Informatica, University of Pisa, Pisa, Italy (August 1984).

    Google Scholar 

  4. W. Eberly, Very Fast Parallel Matrix and Polynomial Arithmetic, Proc. 25-th Ann. IEEE Symp. FOCS, 21–30 (1984).

    Google Scholar 

  5. C.M. Fiduccia, Fast Matrix Multiplication, Proc. 3-rd Ann. Symp. Theory of Computing, 45–49 (1971).

    Google Scholar 

  6. D.E. Knuth, The Art of Computer Programming, v. 2, Addison-Wesley (1981).

    Google Scholar 

  7. J.C. Lafon Base Tensorielle des matrices de Hankel (ou de Toeplitz), Applications. Numer. Math. 23, 249–361 (1975).

    Google Scholar 

  8. V. Pan, The Bit-Operation Complexity of the Convolution of Vectors and of the DFT, Tech. Rep. 80-6, Computer Sci. Dept., SUNY, Albany, NY (1980).

    Google Scholar 

  9. V. Pan, How to Multiply Matrices Faster, Lecture Notes in Computer Science, v. 179, Springer-Verlag (1984).

    Google Scholar 

  10. J. Reif, Logarithmic Depth Circuits for Algebraic Functions, Proc. 23-rd Ann. IEEE Symp. FOCS, 138–145 (1983).

    Google Scholar 

  11. A. Schönhage, Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coefficients, Proc. EUROCAM, Marseille (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Pisa, Pisa, Italy

    Dario Bini

  2. SUNY Albany, Albany, New York, USA

    Victor Pan

Authors
  1. Dario Bini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bob F. Caviness

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bini, D., Pan, V. (1985). Algorithms for polynomial division. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_229

Download citation

  • DOI: https://doi.org/10.1007/3-540-15984-3_229

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15984-1

  • Online ISBN: 978-3-540-39685-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation