Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with alexandrov-fenchel inequalities:
TR07-037 | 2nd February 2007
Leonid Gurvits

Polynomial time algorithms to approximate mixed volumes within a simply exponential factor

Revisions: 1

We study in this paper randomized algorithms to approximate the mixed volume of well-presented convex compact sets.
Our main result is a poly-time algorithm which approximates $V(K_1,...,K_n)$ with multiplicative error $e^n$ and
with better rates if the affine dimensions of most of the sets $K_i$ are small.\\
Our approach is ... more >>>

ISSN 1433-8092 | Imprint