Amirazizi, Hamid R.; Karnin, Ehud D.; Reyneri, Justin M. Compact knapsacks are polynomially solvable. Extended abstract. (English) Zbl 0501.68012 SIGACT News 15, No. 1, 20-22 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 68Q25 Analysis of algorithms and problem complexity 90C10 Integer programming 94A99 Communication, information Keywords:cryptography; knapsack problem; public key cryptographic system PDF BibTeX XML