The Mixed Volume of n polytopes in n-dimensional space is a multilinear function with respect to Minkowski addition and scalar multiplication that generalizes the notion of volume. The current interest in efficient methods for computing it is mainly due to Bernstein's theorem which bounds the number of common roots of a system of polynomial equations by the Mixed Volume of the respective Newton polytopes. In this paper we propose an algorithm that uses polyhedral techniques to significantly improve upon the efficiency of the method based on evaluating the inclusion-exclusion formula and obtain a practical algorithm.
Title
An Efficient Computation of Mixed Volume
Published
1993-04-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-93-734
Type
Text
Extent
8 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
