Are most low-density knapsacks solvable in polynomial time
Conference
·
OSTI ID:6232580
In this paper, we show how techniques similar to those developed for breaking the cryptosystems can be used to solve knapsacks of low density. In the examples we have run, the algorithm has always been successful on knapsacks of density less than or equal to 1/2. We show, based on one assumption, that the algorithm will succeed on most knapsacks of density less than or equal to 1/3.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (USA)
- DOE Contract Number:
- AC04-76DP00789
- OSTI ID:
- 6232580
- Report Number(s):
- SAND-83-0099C; CONF-830228-1; ON: DE83010511
- Resource Relation:
- Conference: 14. southeastern conference on combinatorics, graph theory and computing, Boca Raton, FL, USA, 14 Feb 1983
- Country of Publication:
- United States
- Language:
- English
Similar Records
Approximating the 0-1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation
New knapsack-based cryptosystem
Preliminary report on the cryptanalysis of Merkle-Hellman knapsack cryptosystems
Conference
·
Fri Sep 03 00:00:00 EDT 1999
·
OSTI ID:6232580
New knapsack-based cryptosystem
Conference
·
Sat Jan 01 00:00:00 EST 1983
·
OSTI ID:6232580
Preliminary report on the cryptanalysis of Merkle-Hellman knapsack cryptosystems
Technical Report
·
Fri Jan 01 00:00:00 EST 1982
·
OSTI ID:6232580