Skip to main content

Polynomial decomposition algorithm of almost quadratic complexity

  • Extended Abstracts
  • Conference paper
  • First Online:
Book cover Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1988)

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barton, D & Zippel, R. "Polynomial decomposition algorithms" J. Symbolic Comp. (1985) 1, 159–168.

    Google Scholar 

  2. Gutiérrez, J & Ruiz de Velasco, C. "A polynomial decomposition algorithm" J. Symbolic Comp. (submitted, February 1988)

    Google Scholar 

  3. Vinogradov, I. "Fundamentos de la teoria de los numeros" Ed. Mir. Moscu (1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Teo Mora

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gutiérrez, J., Recio, T., Ruiz de Velasco, C. (1989). Polynomial decomposition algorithm of almost quadratic complexity. In: Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1988. Lecture Notes in Computer Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51083-4_83

Download citation

  • DOI: https://doi.org/10.1007/3-540-51083-4_83

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51083-3

  • Online ISBN: 978-3-540-46152-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics