Pages that link to "Item:Q4289294"
From MaRDI portal
The following pages link to A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294):
Displaying 10 items.
- Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Using stratified sampling to solve the Knapsack problem (Q1286279) (← links)
- Learning fixed-dimension linear thresholds from fragmented data (Q1854473) (← links)
- On approximating weighted sums with exponentially many terms (Q1880781) (← links)
- Faster FPTASes for counting and random generation of knapsack solutions (Q2417856) (← links)
- Gap Filling as Exact Path Length Problem (Q2814587) (← links)
- A Faster FPTAS for #Knapsack (Q5002742) (← links)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
- Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)
