Polynomial Complexity Recognizing a Tropical Linear Variety

DOI10.1007/978-3-319-24021-3_11MaRDI QIDQ3454539zbMATH OpenOpenAlexFDO

Authors Dima Grigoriev

Publication date 25 November 2015

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.06126

zbMATH Keywords

polynomial complexityrecognizing tropical linear variety

Mathematics Subject Classification ID

Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Tropical geometry (14T99) Analysis of algorithms and problem complexity (68Q25)

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

Cited in

(5)

• Detecting tropical defects of polynomial equations
• Complexity of deciding whether a tropical linear prevariety is a tropical variety
• Computing tropical varieties
• Polynomiality properties of tropical refined invariants
• What Tropical Geometry Tells Us about the Complexity of Linear Programming

This page was built for publication: Polynomial Complexity Recognizing a Tropical Linear Variety

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454539)