Pages that link to "Item:Q3985814"

The following pages link to An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (Q3985814):

Displaying 13 items.

• Counting subset sums of finite Abelian groups (Q645970) (← links)
• When subset-sums do not cover all the residues modulo \(p\). (Q1427982) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• Moment subset sums over finite fields (Q2302567) (← links)
• Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
• Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (Q2904488) (← links)
• Complement, Complexity, and Symmetric Representation (Q2949722) (← links)
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (Q3220352) (← links)
• Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
• Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
• An Average-Case Sublinear Exact Li and Stephens Forward Algorithm (Q5090334) (← links)
• Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum (Q5144983) (← links)
• Subset Sum Quantumly in 1.17 n . (Q5889072) (← links)