Pages that link to "Item:Q4302827"
From MaRDI portal
The following pages link to A random polynomial-time algorithm for approximating the volume of convex bodies (Q4302827):
Displaying 50 items.
- Randomized interior point methods for sampling and optimization (Q259600) (← links)
- A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding (Q290854) (← links)
- 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)
- Exploring stochasticity and imprecise knowledge based on linear inequality constraints (Q314508) (← links)
- One-dimensional three-state quantum walk with single-point phase defects (Q332581) (← links)
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm (Q421722) (← links)
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
- A generalization of Löwner-John's ellipsoid theorem (Q494343) (← links)
- Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts (Q494597) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- A polynomial number of random points does not determine the volume of a convex body (Q542396) (← links)
- Computing the volume, counting integral points, and exponential sums (Q685177) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- Interdependent defense games with applications to internet security at the level of autonomous systems (Q725097) (← links)
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← 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)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Similarity of personal preferences: Theoretical foundations and empirical analysis (Q814460) (← links)
- On the complete instability of interval polynomials (Q880159) (← 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)
- Extended studies of separability functions and probabilities and the relevance of Dyson indices (Q950261) (← links)
- On the random generation of monotone data sets (Q963446) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- What do we know about the Metropolis algorithm? (Q1273859) (← links)
- Balanced pairs in partial orders (Q1301727) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- On the problem of approximating the number of bases of a matroid (Q1321827) (← links)
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Mixing times of lozenge tiling and card shuffling Markov chains (Q1431558) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Query by committee, linear separation and random walks. (Q1603591) (← links)
- Sampling from a log-concave distribution with projected Langevin Monte Carlo (Q1650786) (← links)
- Total variation discrepancy of deterministic random walks for ergodic Markov chains (Q1675930) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
- Efficiency test of pseudorandom number generators using random walks (Q1765462) (← links)
- Learning mixtures of separated nonspherical Gaussians (Q1774210) (← links)
- The Santalo point of a planar convex set (Q1802415) (← links)
- Random walks on a finite graph with congestion points (Q1827003) (← links)
- A unifying geometric solution framework and complexity analysis for variational inequalities (Q1919807) (← links)