scientific article; zbMATH DE number 431987
From MaRDI portal
Publication:3138745
Recommendations
Cited in
(24)- On the Complexity of Computing the Volume of a Polyhedron
- The Santalo point of a planar convex set
- On The Complexity of Computing Mixed Volumes
- scientific article; zbMATH DE number 665697 (Why is no real title available?)
- scientific article; zbMATH DE number 1538124 (Why is no real title available?)
- Easy and optimal queries to reduce set uncertainty
- Counting linear extensions
- Optimal oversampling ratio in two-step simulation
- scientific article; zbMATH DE number 5302815 (Why is no real title available?)
- A quick estimate for the volume of a polyhedron
- Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
- Different Volume Computation Methods of Graph Polytopes
- How to integrate a polynomial over a simplex
- The best ways to slice a polytope
- Ehrhart polynomials of matroid polytopes and polymatroids
- Performance metric and analytical gain optimality for set-based robust fault detection
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Decoupling and Partial Independence
- Scientific contributions of Leo Khachiyan (a short overview)
- Dispersion of mass and the complexity of randomized geometric algorithms
- scientific article; zbMATH DE number 4108152 (Why is no real title available?)
- A Laplace transform algorithm for the volume of a convex polytope
- Polytope Volume Computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138745)