| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 11008023 | Journal of Symbolic Computation | 2019 | 8 Pages |
Abstract
We present a new algorithmic framework which utilizes tropical geometry and homotopy continuation for solving systems of polynomial equations where some of the polynomials are generic elements in linear subspaces of the polynomial ring. This approach generalizes the polyhedral homotopies by Huber and Sturmfels.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Anton Leykin, Josephine Yu,