Pages that link to "Item:Q1785211"
From MaRDI portal
The following pages link to A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211):
Displaying 9 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← 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)
- Approximation complexity of sums of random processes (Q2274403) (← 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)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- Efficient optimal Kolmogorov approximation of random variables (Q6494381) (← links)
