How to compute the volume in high dimension?
From MaRDI portal
Publication:1403293
DOI10.1007/s10107-003-0447-xzbMath1106.68433OpenAlexW8679120MaRDI QIDQ1403293
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0447-x
Computational aspects related to convexity (52B55) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (12)
Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model ⋮ A parallel implementation of an \(O^\ast(n^4)\) volume algorithm ⋮ Entanglement in bipartite quantum systems: Euclidean volume ratios and detectability by Bell inequalities ⋮ A note on approximation of a ball by polytopes ⋮ On the volume of unit balls of finite-dimensional Lorentz spaces ⋮ Computational results of an \(O^{\ast }(n^{4})\) volume algorithm ⋮ An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions ⋮ Expander graphs and their applications ⋮ Dispersion of mass and the complexity of randomized geometric algorithms ⋮ Calculating the free energy of nearly jammed hard-particle packings using molecular dynamics ⋮ High-dimensional nonparametric density estimation via symmetry and shape constraints ⋮ Book Review: Inevitable randomness in discrete mathematics
This page was built for publication: How to compute the volume in high dimension?
