Pages that link to "Item:Q5375394"

The following pages link to A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem (Q5375394):

Displayed 2 items.

• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) ‎ (← links)
• An efficient pruning algorithm for value independent knapsack problem using a DAG structure (Q1891244) ‎ (← links)