Optimal oversampling ratio in two-step simulation
From MaRDI portal
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Statistical sampling theory and related topics (62D99) Monte Carlo methods (65C05)
Recommendations
Cites work
- A random polynomial-time algorithm for approximating the volume of convex bodies
- scientific article; zbMATH DE number 431987 (Why is no real title available?)
- scientific article; zbMATH DE number 3196612 (Why is no real title available?)
- The problem of calculating the volume of a polyhedron is enumerably hard
- Two Algorithms for Determining Volumes of Convex Polyhedra
This page was built for publication: Optimal oversampling ratio in two-step simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614296)