Pages that link to "Item:Q3034820"

The following pages link to The problem of calculating the volume of a polyhedron is enumerably hard (Q3034820):

Displaying 21 items.

• What is the complexity of volume calculation? (Q700188) (← links)
• On the reverse Loomis-Whitney inequality (Q724946) (← links)
• An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes (Q784479) (← links)
• Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
• Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
• Computing the volume is difficult (Q1093369) (← links)
• Rank constrained distribution and moment computations (Q1658540) (← links)
• Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
• On safe tractable approximations of chance constraints (Q1926690) (← links)
• Polyhedral circuits and their applications (Q2039640) (← links)
• Chance-constrained controller state and reference governor (Q2065213) (← links)
• Chance-constrained sets approximation: a probabilistic scaling approach (Q2071956) (← links)
• New safe approximation of ambiguous probabilistic constraints for financial optimization problem (Q2296548) (← links)
• Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings (Q2670574) (← links)
• Routing optimization under uncertainty (Q2806069) (← links)
• (Q3106038) (← links)
• Volume of Hypercubes Clipped by Hyperplanes and Combinatorial Identities (Q3299334) (← links)
• Managing Underperformance Risk in Project Portfolio Selection (Q3450467) (← links)
• (Q3832046) (← links)
• Using Histograms to Better Answer Queries to Probabilistic Logic Programs (Q4649723) (← links)
• Optimal oversampling ratio in two-step simulation (Q6614296) (← links)