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)
68Q25: Analysis of algorithms and problem complexity
68U99: Computing methodologies and applications
52Bxx: Polytopes and polyhedra
Related Items
Using Histograms to Better Answer Queries to Probabilistic Logic Programs, What is the complexity of volume calculation?, On the reverse Loomis-Whitney inequality, An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes, Scientific contributions of Leo Khachiyan (a short overview), Approximating the volume of unions and intersections of high-dimensional geometric objects, 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, Polyhedral circuits and their applications, Chance-constrained controller state and reference governor, Chance-constrained sets approximation: a probabilistic scaling approach, New safe approximation of ambiguous probabilistic constraints for financial optimization problem, Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings, Routing Optimization Under Uncertainty, Volume of Hypercubes Clipped by Hyperplanes and Combinatorial Identities, Managing Underperformance Risk in Project Portfolio Selection
