Computing puiseux-series solutions to determinatal equations via combinatorial relaxation | SpringerLink
Skip to main content
Springer Nature Link
Log in

Computing puiseux-series solutions to determinatal equations via combinatorial relaxation

  • Conference paper
  • First Online:
Algorithms (SIGAL 1990)

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

Included in the following conference series:

  • 186 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. H. Cunningham: A network simplex method. Mathematical Programming, Vol. 11 (1976), 105–116.

    Article  Google Scholar 

  2. M. J. Eisner and D. G. Severance: Mathematical techniques for efficient record segmentation in large shared database, Journal of the Association for Computing Machinery, Vol. 23 (1976), 619–635.

    Google Scholar 

  3. D. Gusfield: Parametric combinatorial computing and a problem of program module distribution, Journal of the Association for Computing Machinery, Vol. 30 (1983), 551–563.

    Google Scholar 

  4. K. Murota: Computing Puiseux-series solutions to determinantal equations via combinatorial relaxation, to appear in SIAM Journal on Computing. Also: Computing Puiseux-series expansion via combinatorial relaxation, Report No. 89593-OR, Institut für Ökonometrie und Operations Research, Universität Bonn, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Engineering and Information Physics, University of Tokyo, 113, Tokyo, Japan

    Kazuo Murota

Authors
  1. Kazuo Murota
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Toshihide Ibaraki Hiroshi Imai Takao Nishizeki

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Murota, K. (1990). Computing puiseux-series solutions to determinatal equations via combinatorial relaxation. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-52921-7_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52921-7

  • Online ISBN: 978-3-540-47177-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation