Pages that link to "Item:Q421722"
From MaRDI portal
The following pages link to Computational results of an \(O^{\ast }(n^{4})\) volume algorithm (Q421722):
Displaying 13 items.
- Random sampling: billiard walk algorithm (Q296789) (← links)
- A practical volume algorithm (Q298158) (← links)
- A parallel implementation of an \(O^\ast(n^4)\) volume algorithm (Q302146) (← links)
- Algorithmic aspects of alternating sum of volumes. I: Data structure and difference operation (Q808222) (← links)
- Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
- On the density of lines and Santalo's formula for computing geometric size measures (Q2026642) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- On the sample-mean method for computing hyper-volumes (Q2315358) (← links)
- Fast multivariate log-concave density estimation (Q2337320) (← links)
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) (← links)
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes (Q3452552) (← links)
- Random walks and anO*(n5) volume algorithm for convex bodies (Q4350884) (← links)
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume (Q4571932) (← links)
