scientific article; zbMATH DE number 841436

zbMATH Open0847.52012MaRDI QIDQ4863381FDOQ4863381

Authors: Alexander Hufnagel 

Publication date: 4 February 1996

Title of this publication is not available (Why is that?)

Recommendations

• On The Complexity of Computing Mixed Volumes
• On the Complexity of Computing the Volume of a Polyhedron
• scientific article; zbMATH DE number 665697
• scientific article; zbMATH DE number 1182920
• A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor

zbMATH Keywords

mixed volumesvolume computationBrunn-Minkowski theorygeometric algorithmsMinkowski's theorem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)

Cited In (8)

• An algorithmic proof of Brégman–Minc theorem
• Title not available (Why is that?)
• On the hardness of computing intersection, union and Minkowski sum of polytopes
• A geometric inequality and the complexity of computing volume
• From the zonotope construction to the Minkowski addition of convex polytopes
• On the hardness of minkowski addition and related operations
• Algorithms for Minkowski products and implicitly-defined complex sets
• On the Algorithmic Complexity of Minkowski's Reconstruction Theorem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863381)