On the Complexity of Computing the Volume of a Polyhedron
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- Ehrhart polynomials of matroid polytopes and polymatroids
- Counting linear extensions
- Algorithms for computing centroids
- Mathematical programming and the sensitivity of multi-criteria decisions
- Computing the Ehrhart polynomial of a convex lattice polytope
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Mean utility in the assurance region model
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- Approximate counting in SMT and value estimation for probabilistic programs
- Modeling project preferences in multiattribute portfolio decision analysis
- A tropical isoperimetric inequality
- Easy and optimal queries to reduce set uncertainty
- The Santalo point of a planar convex set
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Markov chains, Hamiltonian cycles and volumes of convex bodies
- Polyhedral circuits and their applications
- Energy and reserve dispatch with distributionally robust joint chance constraints
- An algorithm for computing phase space structures in chemical reaction dynamics using Voronoi tessellation
- Generalized adaptive partition-based method for two-stage stochastic linear programs: geometric oracle and analysis
- Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises
- Hierarchical clustering of constrained dynamic systems using robust positively invariant sets
- Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space
- Semiring programming: a semantic framework for generalized sum product problems
- Tropical Ehrhart theory and tropical volume
- Probabilistic Lipschitz analysis of neural networks
- The harmonic polytope
- Local formulas for Ehrhart coefficients from lattice tiles
- The volume of a crosspolytope truncated by a halfspace
- Uniqueness of Gibbs measures for continuous hardcore models
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic
- Robust optimal control with adjustable uncertainty sets
- A comparison of four approaches from stochastic programming for large-scale unit-commitment
- Exploiting polyhedral symmetries in social choice
- Computational complexity of stochastic programming problems
- Approximation of convex sets by polytopes
- Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method
- Exploiting sparsity for semi-algebraic set volume computation
- Exploiting symmetries in polyhedral computations
- Book review of: Inevitable randomness in discrete mathematics, by József Beck
- A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding
- Bayesian inference over ICA models: application to multibiometric score fusion with quality estimates
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths
- How to integrate a polynomial over a simplex
- A comment on ``Computational complexity of stochastic programming problems
- scientific article; zbMATH DE number 431987 (Why is no real title available?)
- Exploring stochasticity and imprecise knowledge based on linear inequality constraints
- Volume of hypercubes clipped by hyperplanes and combinatorial identities
- Polytope Volume Computation
- Calculating Probabilities of Real-Time Test Cases
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes
- scientific article; zbMATH DE number 5302815 (Why is no real title available?)
- Approximating the centroid is hard
- Complexity of approximating the vertex centroid of a polyhedron
- Computing Volumes of Polyhedra
- Hard Enumeration Problems in Geometry and Combinatorics
- scientific article; zbMATH DE number 4108152 (Why is no real title available?)
- A sweep-plane algorithm for generating random tuples in simple polytopes
- Some more n‐dimensional geometry†
- (Deterministic) algorithms that compute the volume of polytopes
- On The Complexity of Computing Mixed Volumes
- Deterministic and randomized polynomial‐time approximation of radii
- Different Volume Computation Methods of Graph Polytopes
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume
- Expected number of vertices of a hypercube slice
- Ambiguous joint chance constraints under mean and dispersion information
- Using histograms to better answer queries to probabilistic logic programs
- scientific article; zbMATH DE number 841436 (Why is no real title available?)
- Halving the Bounds for the Markov, Chebyshev, and Chernoff Inequalities Using Smoothing
- Worst-Case Expected Shortfall with Univariate and Bivariate Marginals
- Practical volume estimation of zonotopes by a new annealing schedule for cooling convex bodies
- Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets
- scientific article; zbMATH DE number 7236423 (Why is no real title available?)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- Polar degrees and closest points in codimension two
- Approximating the volume of tropical polytopes is difficult
- Semi-discrete optimal transport: hardness, regularization and numerical solution
- Computing Galois groups of Ehrhart polynomials in OSCAR
- An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions
- Eigenpolytope Universality and Graphical Designs
- A practical algorithm for volume estimation based on billiard trajectories and simulated annealing
- Assumed strain methods in micromechanics, laminate composite voxels and level sets
- The moment-SOS hierarchy: applications and related topics
- A quick estimate for the volume of a polyhedron
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
- Polytopes in the Fiat-Shamir with aborts paradigm
- The best ways to slice a polytope
- Deterministically approximating the volume of a Kostka polytope
- Computing the volume, counting integral points, and exponential sums
- Computing asymptotic bounds for small roots in Coppersmith's method via sumset theory
- A sampling-based method to estimate the volume of solution space for linear arithmetic constraints
- An \(\mathcal{O} (n)\) algorithm for generating uniform random vectors in \(n\)-dimensional cones
- Aggregate operators in constraint query languages
- On the reverse Loomis-Whitney inequality
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution
- Counting locally optimal tours in the TSP
This page was built for publication: On the Complexity of Computing the Volume of a Polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3821581)
