Skip to main content
Conference Proceedings

Tropical Newton–Puiseux Polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 11077 LNCS 177-186
DOI: 10.1007/978-3-319-99639-4_12
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce tropical Newton–Puiseux polynomials admitting rational exponents. A resolution of a tropical hypersurface is defined by means of a tropical Newton–Puiseux polynomial. A polynomial complexity algorithm for resolubility of a tropical curve is designed. The complexity of resolubility of tropical prevarieties of arbitrary codimensions is studied.

Author supplied keywords

Cite

CITATION STYLE

APA

Grigoriev, D. (2018). Tropical Newton–Puiseux Polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11077 LNCS, pp. 177–186). Springer Verlag. https://doi.org/10.1007/978-3-319-99639-4_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free