[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Polynomial complexity of the Newton-Puiseux algorithm

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

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

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. S.S. Abhyankar and T.T. Moh. Newton-Puiseux expansion and generalized Tchirnhausen transformation. — J.reine angew.Math., 1973, vol.260, p.47–83 and 1973, vol.261, p.29–54.

    Google Scholar 

  2. А.Л. Чистов. Алгоритм полиномиалъной сложности для разложения многочленов и нахождение компонент многообразия в субэкспоненциальное время. — Зап. научн. семин. ЛОМИ, 1984, т.137, с.124–188.

    Google Scholar 

  3. H.T. Kung and J.F. Traub. All algebraic functions can be computed fast. — J.Assoc.Comp.Mach., 1978, vol.25, N 2, p.245–260.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leningrad Institute for Informatics and Automation, USSR Academy of Sciences, 14-th line, 39, 199178, Leningrad, USSR

    A. L. Chistov

Authors
  1. A. L. Chistov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chistov, A.L. (1986). Polynomial complexity of the Newton-Puiseux algorithm. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016248

Download citation

  • DOI: https://doi.org/10.1007/BFb0016248

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation