Pages that link to "Item:Q4972686"

The following pages link to Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686):

Displaying 20 items.

• More on change-making and related problems (Q2051861) (← links)
• Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
• Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• The Modular Subset-Sum Problem and the size of deletion correcting codes (Q2161417) (← links)
• Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
• Irredundant Set Faster Than O(2 n ) (Q3563010) (← links)
• Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
• Fast Monotone Summation over Disjoint Sets (Q4899250) (← links)
• Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
• (Q5075820) (← links)
• Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
• (Q5491026) (← links)
• (Q5874497) (← links)
• Generalization of the subset sum problem and cubic forms (Q6039136) (← links)
• Algebraic algorithms for variants of subset sum (Q6102280) (← links)
• One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
• Approximating subset sum ratio via partition computations (Q6541032) (← links)