The following pages link to STACS 2005 (Q5710684):
Displaying 9 items.
- A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513) (← links)
- Solving low-density multiple subset sum problems with SVP oracle (Q2416533) (← links)
- Constructing Carmichael numbers through improved subset-product algorithms (Q2871190) (← links)
- Subset sum in the absence of concentration (Q2954983) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (Q3985814) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem (Q5387614) (← links)
