Computing mixed volume and all mixed cells in quermassintegral time

Abstract

The mixed volume counts the roots of generic sparse polynomial systems. Mixed cells are used to provide starting systems for homotopy algorithms that can find all those roots, and track no unnecessary path. Up to now, algorithms for that task were of enumerative type, with no general non- exponential complexity bound. A geometric algorithm is introduced in this paper. Its complexity is bounded in the average and probability-one settings in terms of some geometric invariants: quermassintegrals associated to the tuple of convex hulls of the support of each polynomial. Besides the complexity bounds, numerical results are reported. Those are consistent with an output- sensitive running time for each benchmark family where data is available. For some of those families, an asymptotic running time gain over the best code available at this time was noticed.

final revision

References in corpus (2)

• Tropical Homotopy Continuation
• Do most polynomials generate a prime ideal?

Cited by in corpus (8)

• Tropical Homotopy Continuation
• Do most polynomials generate a prime ideal?
• Unmixing the mixed volume computation
• Efficient edge-skeleton computation for polytopes defined by oracles
• Complexity of Sparse Polynomial Solving 2: Renormalization
• A Polyhedral Homotopy Algorithm For Real Zeros
• Computing Tropical Prevarieties in Parallel
• The Nullstellensatz and Positivstellensatz for Sparse Tropical Polynomial Systems