Skip to main content
SpringerLink
Log in

Polynomial Complexity Recognizing a Tropical Linear Variety

  • Conference paper
  • First Online:
Computer Algebra in Scientific Computing (CASC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9301))

Included in the following conference series:

Abstract

A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Akian, M., Gaubert, S., Guterman, A.: Tropical polyhedra are equivalent to correspondence mean payoff games. Int. J. Algebra Comput. 22(1), 1250001, 43 p. (2012)

    Google Scholar 

  2. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Berlin (2006)

    Google Scholar 

  3. Bogart, T., Jensen, A.N., Speyer, D., Sturmfels, B., Thomas, R.R.: Computing tropical varieties. J. Symb. Comput. 42, 54–73 (2007)

    Google Scholar 

  4. Butkovic, P.: Min-plus Systems: Theory and Algorithms. Springer, London (2010)

    Google Scholar 

  5. Chistov, A.: An algorithm of polynomial complexity for factoring polynomials, and determination of the components of a variety in a subexponential time. J. Soviet Math. 34, 1838–1882 (1986)

    Google Scholar 

  6. Chistov, A.L.: Polynomial complexity of Newton-Puiseux algorithm. In: Gruska, J., Rovan, B., Wiedermann, J. (eds.) Mathematical Foundations of Computer Science 1986. LNCS, vol. 233, pp. 247–255. Springer, Heidelberg (1986)

    Google Scholar 

  7. Einsiedler, M., Kapranov, M., Lind, D.: Non-archemidean amoebas and tropical varieties. J. Reine Angew. Math. 601, 139–157 (2007)

    Google Scholar 

  8. Garey, M., Johnson, D.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)

    Google Scholar 

  9. Grigoriev, D.: Complexity of solving tropical linear systems. Computational Complexity 22, 71–88 (2013)

    Google Scholar 

  10. Grigoriev, D.: Polynomial factoring over a finite field and solving systems of algebraic equations. J. Soviet Math. 34, 1762–1803 (1986)

    Google Scholar 

  11. Grigoriev, D., Vorobjov, N.: Solving systems of polynomial inequalities in subexponential time. J. Symp. Comput. 5, 37–64 (1988)

    Google Scholar 

  12. Itenberg, I., Mikhalkin, G., Shustin, E.: Tropical algebraic geometry. Oberwolfach Seminars, vol. 35. Birkhauser, Basel (2009)

    Google Scholar 

  13. Maclagan, D., Sturmfels, B.: Introduction to Tropical Geometry. Graduate Studies in Math., vol. 161. AMS, Providence (2015)

    Google Scholar 

  14. Speyer, D., Sturmfels, B.: The tropical Grassmanian. Adv. Geom. 4, 389–411 (2004)

    Google Scholar 

  15. Theobald, T.: On the frontiers of polynomial computations in tropical geometry. J. Symbolic Comput. 41, 1360–1375 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, Mathématiques, Université de Lille, Villeneuve d’Ascq, 59655, France

    Dima Grigoriev

Authors
  1. Dima Grigoriev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dima Grigoriev .

Editor information

Editors and Affiliations

  1. Laboratory of Information Technologies, Joint Institute of Nuclear Research, Dubna, Russia

    Vladimir P. Gerdt

  2. Institute for Mathematics, Universität Kassel, Kassel, Germany

    Wolfram Koepf

  3. Institut für Mathematik, Universität Kassel, Kassel, Hessen, Germany

    Werner M. Seiler

  4. Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Grigoriev, D. (2015). Polynomial Complexity Recognizing a Tropical Linear Variety. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2015. Lecture Notes in Computer Science(), vol 9301. Springer, Cham. https://doi.org/10.1007/978-3-319-24021-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24021-3_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24020-6

  • Online ISBN: 978-3-319-24021-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation