Pages that link to "Item:Q1262760"
From MaRDI portal
The following pages link to Solving dense subset-sum problems by using analytical number theory (Q1262760):
Displaying 7 items.
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks (Q685660) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- Bisecting binomial coefficients (Q2357134) (← links)
- Phase transition and finite-size scaling for the integer partitioning problem (Q2772921) (← 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)
