On The Complexity of Computing Mixed Volumes
DOI10.1137/S0097539794278384zbMath0909.68193OpenAlexW2005392884MaRDI QIDQ4388877
Martin Dyer, Alexander Hufnagel, Peter Gritzmann
Publication date: 10 May 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539794278384
volumecomputational complexityNewton polytopeapproximationzonotopepolytoperandomized algorithmconvex bodypolynomial-time algorithmpolynomial equationspartial orderpermanentNP-hardnesscomputationdeterministic algorithmmixed volumesparallelotopecomputational convexitylattice point enumerator\(\# P\)-hardnessdeterminant problems
Convex programming (90C25) Computational aspects related to convexity (52B55) Nonlinear programming (90C30) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Mixed volumes and related topics in convex geometry (52A39) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items