Pages that link to "Item:Q964408"
From MaRDI portal
The following pages link to On exponential time lower bound of Knapsack under backtracking (Q964408):
Displaying 4 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- NEW WORST-CASE UPPER BOUND FOR COUNTING EXACT SATISFIABILITY (Q2941085) (← links)
- Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem (Q3796962) (← links)
- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model (Q5425476) (← links)