Pages that link to "Item:Q1087143"

The following pages link to A geometric inequality and the complexity of computing volume (Q1087143):

Displaying 28 items.

• On optimal disc covers and a new characterization of the Steiner center (Q283866) (← 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)
• Similarity of personal preferences: Theoretical foundations and empirical analysis (Q814460) (← links)
• Dispersion of mass and the complexity of randomized geometric algorithms (Q947778) (← links)
• Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
• Computing the volume is difficult (Q1093369) (← links)
• On the shape of the convex hull of random points (Q1099869) (← links)
• On the problem of approximating the number of bases of a matroid (Q1321827) (← links)
• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
• The curse of dimensionality for numerical integration on general domains (Q1633623) (← links)
• MCMC convergence diagnosis via multivariate bounds on log-concave densities (Q1807067) (← links)
• Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises (Q2096364) (← links)
• Large deviations, moderate deviations, and the KLS conjecture (Q2210452) (← links)
• Probabilistic Lipschitz analysis of neural networks (Q2233541) (← links)
• The curse of dimensionality for the class of monotone functions and for the class of convex functions (Q2275488) (← links)
• Approximating the volume of convex bodies (Q2368127) (← links)
• The curse of dimensionality for numerical integration of smooth functions. II (Q2442811) (← links)
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) (← links)
• Uniform generation in spatial constraint databases and applications (Q2495401) (← links)
• Exploiting sparsity for semi-algebraic set volume computation (Q2696572) (← links)
• Heat flow and a faster algorithm to compute the surface area of a convex body (Q2868081) (← links)
• Some Results on the Complexity of Numerical Integration (Q2957029) (← links)
• An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths (Q2980930) (← links)
• How to integrate a polynomial over a simplex (Q3081285) (← links)
• (Q5115786) (← links)
• Near-optimal deterministic algorithms for volume computation via M-ellipsoids (Q5170985) (← links)
• Blessing of dimensionality at the edge and geometry of few-shot learning (Q6057404) (← links)