scientific article; zbMATH DE number 65730

MaRDI QIDQ4010341zbMATH OpenFDO

Authors László Lovász

Publication date 27 September 1992

zbMATH Keywords

volumecomputational complexityrandomizationapproximationsoracleellipsoids\(NP\)-hardness\(d\)-dimensional convex body

Mathematics Subject Classification ID

Markov processes (60J99) Analysis of algorithms and problem complexity (68Q25) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Approximation by convex sets (52A27)

Recommendations

• What is the complexity of volume calculation?
• How to compute the volume in high dimension?
• Computing the volume is difficult
• A VOLUME FORMULA
• On a method of volume calculation for bodies

Cited in

(11)

• A polynomial number of random points does not determine the volume of a convex body
• How to Measure Volume with a Thread
• scientific article; zbMATH DE number 665697 (Why is no real title available?)
• Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
• Geodesic Walks in Polytopes
• Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
• scientific article; zbMATH DE number 18983 (Why is no real title available?)
• Reducing isotropy and volume to KLS: faster rounding and volume algorithms
• How to Approximate the Volume of a Lake
• Dispersion of mass and the complexity of randomized geometric algorithms
• Computing the volume is difficult

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 Q4010341)