The following pages link to A Faster FPTAS for #Knapsack (Q5002742):
Displaying 4 items.
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- On computing probabilistic abductive explanations (Q6116531) (← links)
