The following pages link to Computing the volume is difficult (Q1093369):
Displaying 44 items.
- Parallel degree computation for binomial systems (Q507161) (← links)
- Positive-fraction intersection results and variations of weak epsilon-nets (Q527009) (← links)
- A polynomial number of random points does not determine the volume of a convex body (Q542396) (← links)
- Isomorphic properties of intersection bodies (Q647592) (← links)
- Computing the volume, counting integral points, and exponential sums (Q685177) (← links)
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes (Q784479) (← links)
- Sampling dynamic networks with application to investigation of HIV epidemic drivers (Q900178) (← links)
- Dispersion of mass and the complexity of randomized geometric algorithms (Q947778) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541) (← links)
- Learning convex bodies under uniform distribution (Q1198007) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Inner and outer approximations of polytopes using boxes. (Q1428115) (← links)
- On the number of polynomials of small house (Q1568065) (← links)
- On best \(m\)-term approximations and the entropy of sets in the space \(L^ 1\) (Q1905314) (← links)
- Small-ball probabilities for the volume of random convex sets (Q1953064) (← links)
- Active-learning a convex body in low dimensions (Q2032355) (← links)
- Approximate weighted model integration on DNF structures (Q2082501) (← links)
- Multivariate volume, Ehrhart, and \(h^\ast \)-polynomials of polytropes (Q2156367) (← links)
- Theorems of Carathéodory, Helly, and Tverberg without dimension (Q2197682) (← links)
- Large deviations, moderate deviations, and the KLS conjecture (Q2210452) (← links)
- Probabilistic Lipschitz analysis of neural networks (Q2233541) (← links)
- The harmonic polytope (Q2238223) (← links)
- Approximating the volume of convex bodies (Q2368127) (← links)
- A note on approximation of a ball by polytopes (Q2386205) (← links)
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) (← links)
- Generating a random collection of discrete joint probability distributions subject to partial information (Q2513651) (← links)
- Convex geometry and its applications. Abstracts from the workshop held December 12--18, 2021 (hybrid meeting) (Q2693056) (← links)
- Heat flow and a faster algorithm to compute the surface area of a convex body (Q2868081) (← links)
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths (Q2980930) (← links)
- Concentration phenomena in high dimensional geometry (Q3451705) (← links)
- Stochastic Billiards for Sampling from the Boundary of a Convex Set (Q3465938) (← links)
- Convex Bodies with Few Faces (Q3483935) (← links)
- (Q4291532) (← links)
- Some more n‐dimensional geometry† (Q4299940) (← links)
- (Deterministic) algorithms that compute the volume of polytopes (Q4360038) (← links)
- Deterministic and randomized polynomial‐time approximation of radii (Q4435530) (← links)
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume (Q4571932) (← links)
- Contextual Search via Intrinsic Volumes (Q5092512) (← links)
- Approximating the volume of tropical polytopes is difficult (Q5742783) (← links)
- On 0-1 polytopes with many facets (Q5945246) (← links)
- Tropical Monte Carlo quadrature for Feynman integrals (Q6081310) (← links)
- (Q6084361) (← links)