The problem of calculating the volume of a polyhedron is enumerably hard
From MaRDI portal
Publication:3034820
DOI10.1070/RM1989v044n03ABEH002136zbMath0692.68034MaRDI QIDQ3034820
Publication date: 1989
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Polytopes and polyhedra (52Bxx)
Related Items (17)
Managing Underperformance Risk in Project Portfolio Selection ⋮ Rank constrained distribution and moment computations ⋮ Computing and estimating the volume of the solution space of SMT(LA) constraints ⋮ On safe tractable approximations of chance constraints ⋮ Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Using Histograms to Better Answer Queries to Probabilistic Logic Programs ⋮ What is the complexity of volume calculation? ⋮ Approximating the volume of unions and intersections of high-dimensional geometric objects ⋮ On the reverse Loomis-Whitney inequality ⋮ Polyhedral circuits and their applications ⋮ Routing Optimization Under Uncertainty ⋮ New safe approximation of ambiguous probabilistic constraints for financial optimization problem ⋮ Chance-constrained controller state and reference governor ⋮ Chance-constrained sets approximation: a probabilistic scaling approach ⋮ An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes ⋮ Volume of Hypercubes Clipped by Hyperplanes and Combinatorial Identities
This page was built for publication: The problem of calculating the volume of a polyhedron is enumerably hard
