Pages that link to "Item:Q5495001"
From MaRDI portal
The following pages link to An FPTAS for #Knapsack and Related Counting Problems (Q5495001):
Displayed 21 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)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← 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)
- Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
- Estimating the probability of meeting a deadline in schedules and plans (Q2321333) (← links)
- Theoretical insights and algorithmic tools for decision diagram-based optimization (Q2398513) (← links)
- Faster FPTASes for counting and random generation of knapsack solutions (Q2417856) (← links)
- Computation of the random arrival rule for bankruptcy problems (Q2450699) (← links)
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths (Q2980930) (← links)
- Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← links)
- A Faster FPTAS for #Knapsack (Q5002742) (← links)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- Completeness Results for Counting Problems with Easy Decision (Q5283355) (← links)
- On computing probabilistic abductive explanations (Q6116531) (← links)
- Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)