Pages that link to "Item:Q3821581"
From MaRDI portal
The following pages link to On the Complexity of Computing the Volume of a Polyhedron (Q3821581):
Displaying 50 items.
- A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding (Q290854) (← links)
- A comment on ``Computational complexity of stochastic programming problems'' (Q312699) (← links)
- Exploring stochasticity and imprecise knowledge based on linear inequality constraints (Q314508) (← links)
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization (Q517310) (← links)
- Computing the volume, counting integral points, and exponential sums (Q685177) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- On the reverse Loomis-Whitney inequality (Q724946) (← links)
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- Complexity of approximating the vertex centroid of a polyhedron (Q764376) (← 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)
- On the complete instability of interval polynomials (Q880159) (← links)
- Polarity and the complexity of the shooting experiment (Q951126) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
- Counting linear extensions (Q1183942) (← links)
- Algorithms for computing centroids (Q1207205) (← links)
- Mathematical programming and the sensitivity of multi-criteria decisions (Q1309861) (← links)
- Computing the Ehrhart polynomial of a convex lattice polytope (Q1330880) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Mean utility in the assurance region model (Q1600975) (← links)
- Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- Modeling project preferences in multiattribute portfolio decision analysis (Q1695031) (← links)
- A tropical isoperimetric inequality (Q1745120) (← links)
- Easy and optimal queries to reduce set uncertainty (Q1752234) (← links)
- The Santalo point of a planar convex set (Q1802415) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- Markov chains, Hamiltonian cycles and volumes of convex bodies (Q1945510) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- Energy and reserve dispatch with distributionally robust joint chance constraints (Q2060530) (← links)
- An algorithm for computing phase space structures in chemical reaction dynamics using Voronoi tessellation (Q2077806) (← links)
- Generalized adaptive partition-based method for two-stage stochastic linear programs: geometric oracle and analysis (Q2084001) (← links)
- Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises (Q2096364) (← links)
- Hierarchical clustering of constrained dynamic systems using robust positively invariant sets (Q2103718) (← links)
- Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space (Q2187655) (← links)
- Semiring programming: a semantic framework for generalized sum product problems (Q2206471) (← links)
- Tropical Ehrhart theory and tropical volume (Q2221527) (← links)
- Probabilistic Lipschitz analysis of neural networks (Q2233541) (← links)
- The harmonic polytope (Q2238223) (← links)
- Local formulas for Ehrhart coefficients from lattice tiles (Q2292908) (← links)
- Uniqueness of Gibbs measures for continuous hardcore models (Q2327937) (← links)
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic (Q2345986) (← links)
- Robust optimal control with adjustable uncertainty sets (Q2374497) (← links)
- A comparison of four approaches from stochastic programming for large-scale unit-commitment (Q2397759) (← links)
- Exploiting polyhedral symmetries in social choice (Q2452242) (← links)
- Computational complexity of stochastic programming problems (Q2492669) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
