Pages that link to "Item:Q2417856"

The following pages link to Faster FPTASes for counting and random generation of knapsack solutions (Q2417856):

Displaying 3 items.

• Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
• Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
• On computing probabilistic abductive explanations (Q6116531) (← links)