Pages that link to "Item:Q2903521"

The following pages link to A deterministic polynomial-time approximation scheme for counting knapsack solutions (Q2903521):

Displaying 20 items.

• Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255) (← links)
• A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← 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)
• Total variation discrepancy of deterministic random walks for ergodic Markov chains (Q1675930) (← links)
• A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
• A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
• Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
• Approximate \#knapsack computations to count semi-fair allocations (Q2110714) (← links)
• Faster FPTASes for counting and random generation of knapsack solutions (Q2417856) (← links)
• An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths (Q2980930) (← links)
• (Q3380215) (← links)
• A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
• (Q4636439) (← links)
• A Faster FPTAS for #Knapsack (Q5002742) (← links)
• Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
• Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
• Approximate Counting via Correlation Decay in Spin Systems (Q5743448) (← links)
• Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)
• A simple polynomial-time approximation algorithm for the total variation distance between two product distributions (Q6566594) (← links)