MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Subset sum "cubes" and the complexity of primality testing." – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 23,828 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Improved Low-Density Subset Sum Algorithms  
  • by Matthijs J. Coster, Antoine Joux, Brian A. Lamacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern — 1991 — Computational Complexity
  • …-Odlyzko algorithms reduce the subset sum problem to that of finding a short vector in a lattice. The exact complexity
  • Cited by 54 (12 self)Add To MetaCart
  • The Multiple Subset Sum Problem  
  • by Alberto Caprara, Hans Kellerer, Ulrich Pferschy — 1998 — SIAM Journal of Optimization
  • …The Multiple Subset Sum Problem Alberto Caprara Hans Kellerer Ulrich Pferschy Abstract…
  • Cited by 7 (1 self)Add To MetaCart
  • The Subset Sum Problem (SS)  
  • by In This Lecture
  • … Micciancio Scribe: Alejandro Hevia 1 The Subset Sum Problem (SS) In this lecture, we review some…
  • Add To MetaCart
  • An Interesting Result About Subset Sums  
  • by Nitu Kitchloo Lior, Lior Pachter
  • …An interesting result about subset sums Nitu Kitchloo Lior Pachter November 27, 1993 Abstract We…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB