System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

The hardness of solving subset sum with preprocessing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lobstein, A. ; CNRS, Paris, France

The two problems subset sum and linear decoding (which have given birth to the knapsack and the McEliece public-key cryptosystems) are known to be NP-complete. For linear decoding, it has been proved that, even if one knows the linear code in advance and can preprocess it, the existence of a polynomial-time decoding algorithm would imply that the polynomial-time hierarchy collapses at an early stage. It is proved that the same holds for subset sum. Even if the knapsack is known in advance and can be preprocessed, there is no polynomial-time algorithm solving it, unless the polynomial hierarchy collapses. Also given is the sketch of a new, straightforward proof of this result for linear decoding

Published in:

Information Theory, IEEE Transactions on  (Volume:36 ,  Issue: 4 )