Skip to main content
SpringerLink
Log in

On the complexity of algebraic power series

  • Submitted Contributions
  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1990)

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.E.Alonso, T.Mora, M.Raimondo. A computational model for algebraic power series. J. Pure and Appl. Algebra, to appear.

    Google Scholar 

  2. R. Benedetti, J.J. Risler. Real Algebraic and Semialgebraic sets. Hermann, Paris 1990.

    Google Scholar 

  3. J.Heintz. Definability and fast quantifier elimination in algebraically closed fields. Theoretical Computer Science 24 (1983).

    Google Scholar 

  4. H.T.Kung, J.F.Traub. All Algebraic Functions can Be Computed Fast. J. ACM 25 (1978).

    Google Scholar 

  5. R.Ramanakoraisina. Complexité des fonctions de Nash. Comm. Algebra 17 (1989).

    Google Scholar 

  6. R.Ramanakoraisina. Bézout Theorem for Nash functions. Preprint U.E.R. Math.Univ. Rennes (1989).

    Google Scholar 

  7. O.Zariski, P.Samuel. Commutative Algebra Vol II. Van Nostrand 1960.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Algebra, Facultad de Ciencias Matemáticas, Universidad Complutense, Madrid, Spain

    M. E. Alonso

  2. Dipartimento di Matematica, Universitá di Genova, Italy

    T. Mora & M. Raimondo

Authors
  1. M. E. Alonso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Mora
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Raimondo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shojiro Sakata

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alonso, M.E., Mora, T., Raimondo, M. (1991). On the complexity of algebraic power series. In: Sakata, S. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1990. Lecture Notes in Computer Science, vol 508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54195-0_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-54195-0_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54195-0

  • Online ISBN: 978-3-540-47489-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation