Computing Mixed Volume and All Mixed Cells in Quermassintegral Time

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 with 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 are available. for some of those families, an asymptotic running time gain over the best code available at this time was noticed.