Pages that link to "Item:Q306252"
From MaRDI portal
The following pages link to A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252):
Displayed 7 items.
- The TV advertisements scheduling problem (Q1733325) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← 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)
- 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)