Abstract
This chapter describes a new algorithm for the Knapsack problem that was presented at the 2010 EUROCRYPT conference. In like manner to Björklund’s paper, randomization is used to bring down the exponent of an exponential-time but possibly practical algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lipton, R.J., Regan, K.W. (2013). Nick Howgrave-Graham and Antoine Joux: Attacking the Knapsack Problem. In: People, Problems, and Proofs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41422-0_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-41422-0_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41421-3
Online ISBN: 978-3-642-41422-0
eBook Packages: Computer ScienceComputer Science (R0)