Pages that link to "Item:Q4651531"

The following pages link to Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions (Q4651531):

Displaying 15 items.

• Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
• A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
• On approximating weighted sums with exponentially many terms (Q1880781) (← links)
• The mixing time of switch Markov chains: a unified approach (Q2237855) (← links)
• Estimating the probability of meeting a deadline in schedules and plans (Q2321333) (← links)
• Spectral analysis of finite Markov chains with spherical symmetries (Q2381827) (← links)
• Heat-bath random walks with Markov bases (Q2407392) (← links)
• Faster FPTASes for counting and random generation of knapsack solutions (Q2417856) (← links)
• On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
• Bi-Lipschitz bijection between the Boolean cube and the Hamming ball (Q2630133) (← links)
• On Sampling Simple Paths in Planar Graphs According to Their Lengths (Q2946419) (← links)
• A Faster FPTAS for #Knapsack (Q5002742) (← links)
• (Q5009556) (← links)
• Approximately counting and sampling knowledge states (Q6126887) (← links)
• Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)