The following pages link to Bypassing KLS (Q2941546):
Displaying 16 items.
- A practical volume algorithm (Q298158) (← 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 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)
- Systematics of aligned axions (Q1706848) (← links)
- Normalizing constants of log-concave densities (Q1746544) (← links)
- Efficient sampling in spectrahedra and volume approximation (Q2144244) (← links)
- Randomly coloring simple hypergraphs with fewer colors (Q2361498) (← links)
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths (Q2980930) (← links)
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume (Q4571932) (← links)
- Practical Volume Estimation of Zonotopes by a New Annealing Schedule for Cooling Convex Bodies (Q5039574) (← links)
- Error regions in quantum state tomography: computational complexity caused by geometry of quantum states (Q6172400) (← links)
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast (Q6174808) (← links)
- A practical algorithm for volume estimation based on billiard trajectories and simulated annealing (Q6579766) (← links)
- Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo (Q6601372) (← links)
