Details:
Title | On the frontiers of polynomial computations in tropical geometry | Author(s) | Thorsten Theobald | Type | Article in Journal | Abstract | We study some basic algorithmic problems concerning the intersection of tropical hypersurfaces in general dimension: deciding whether this intersection is nonempty, whether it is a tropical variety, and whether it is connected, as well as counting the number of connected components. We characterize the borderline between tractable and hard computations by proving N P -hardness and # P -hardness results under various strong restrictions of the input data, as well as providing polynomial time algorithms for various other restrictions. | Keywords | Tropical geometry, Tropical varieties, Tropical prevarieties, Computational complexity, NP-hard, Polynomial time algorithms | ISSN | 0747-7171 |
URL |
http://www.sciencedirect.com/science/article/pii/S074771710600099X |
Language | English | Journal | Journal of Symbolic Computation | Volume | 41 | Number | 12 | Pages | 1360 - 1375 | Year | 2006 | Edition | 0 | Translation |
No | Refereed |
No |
|