Pages that link to "Item:Q4096145"

The following pages link to Computing Partitions with Applications to the Knapsack Problem (Q4096145):

Displaying 18 items.

• (Q5121894) (← links)
• The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
• Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
• INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM (Q5408361) (← links)
• Subset Sum Quantumly in 1.17 n . (Q5889072) (← links)
• Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
• Random knapsack in expected polynomial time (Q5917572) (← links)
• Generalization of the subset sum problem and cubic forms (Q6039136) (← links)
• Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)
• A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← links)
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
• Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
• Weighted shortest common supersequence problem revisited (Q6536257) (← links)
• Approximating subset sum ratio via partition computations (Q6541032) (← links)
• Expectation analysis for bounding solutions of the 0-1 knapsack problem (Q6636466) (← links)
• \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)
• Local-search based heuristics for advertisement scheduling (Q6658437) (← links)