| Document Date: 2011-08-31 08:22:53
Open Document File Size: 465,93 KBShare Result on Facebook
Company Daimler / / Event Product Recall / Product Issues / / Facility University of Luxembourg Abstract / / IndustryTerm formal algorithm / classical algorithm / heuristic algorithm / lattice reduction algorithms / golden solution / straightforward meet-in-the-middle algorithm / weaker algorithms / lattice reduction algorithm / concrete algorithm / partial knapsack solutions / partial solutions / correct solution / constant memory algorithm / birthday paradox algorithm / inconsistent solutions / / Person Alexander May / Karl Benz-Stiftung / / Position first author / SVP / / Product Schroeppel-Shamir algorithm / / Technology heuristic algorithm / previous algorithm / Improved Generic Algorithms / adapted Schroeppel-Shamir algorithm / good algorithm / lattice reduction algorithm / concrete algorithm / formal algorithm / birthday paradox algorithm / classical algorithm / 2 Existing Algorithms / close to 1 lattice reduction algorithms / 2 algorithm / 7 Algorithm / constant memory algorithm / straightforward meet-in-the-middle algorithm / Joux Algorithm / same algorithm / weaker algorithms / Schroeppel-Shamir Algorithm / /
SocialTag |
Improved Generic Algorithms for Hard Knapsacks? Anja Becker1,?? , Jean-S´ebastien Coron3 , and Antoine Joux1,2 1 University of Versailles Saint-Quentin-en-Yvelines 2