New algorithm for dense subset-sum problem
Structure theory of set addition, Astérisque, no. 258 (1999), pp. 363-373 
@incollection{AST_1999__258__363_0,
     author = {Chaimovich, Mark},
     title = {New algorithm for dense subset-sum problem},
     booktitle = {Structure theory of set addition},
     editor = {Deshouilliers Jean-Marc and Landreau Bernard and Yudin Alexander A.},
     series = {Ast\'erisque},
     pages = {363--373},
     year = {1999},
     publisher = {Soci\'et\'e math\'ematique de France},
     number = {258},
     mrnumber = {1701210},
     zbl = {0987.90061},
     language = {en},
     url = {https://www.numdam.org/item/AST_1999__258__363_0/}
}
TY  - CHAP
AU  - Chaimovich, Mark
TI  - New algorithm for dense subset-sum problem
BT  - Structure theory of set addition
AU  - Collectif
ED  - Deshouilliers Jean-Marc
ED  - Landreau Bernard
ED  - Yudin Alexander A.
T3  - Astérisque
PY  - 1999
SP  - 363
EP  - 373
IS  - 258
PB  - Société mathématique de France
UR  - https://www.numdam.org/item/AST_1999__258__363_0/
LA  - en
ID  - AST_1999__258__363_0
ER  - 
%0 Book Section
%A Chaimovich, Mark
%T New algorithm for dense subset-sum problem
%B Structure theory of set addition
%A Collectif
%E Deshouilliers Jean-Marc
%E Landreau Bernard
%E Yudin Alexander A.
%S Astérisque
%D 1999
%P 363-373
%N 258
%I Société mathématique de France
%U https://www.numdam.org/item/AST_1999__258__363_0/
%G en
%F AST_1999__258__363_0
Chaimovich, Mark. New algorithm for dense subset-sum problem, dans Structure theory of set addition, Astérisque, no. 258 (1999), pp. 363-373. https://www.numdam.org/item/AST_1999__258__363_0/

[1] Alon N., and Freiman G. A., On Sums of Subsets of a Set of Integers, Combinatorica, 8, 1988, 305-314. | MR | Zbl | DOI

[2] Buzytsky P., and Freiman G. A., Analytical Methods in Integer Programming, Moscow, ZEMJ., (Russian), 1980, 48 pp.

[3] Chaimovich M., An Efficient Algorithm for the Subset-Sum Problem, a manuscript, 1988.

[4] Chaimovich M., Subset-Sum Problems with Different Summands : Computation, Discrete Applied Mathematics, 27, 1990, 277-282. | MR | Zbl | DOI

[5] Chaimovich M., Solving a Value-Independent Knapsack Problem with the Use of Methods of Additive Number Theory, Congressus Numerantium, 72, 1990, 115-123. | MR | Zbl

[6] Chaimovich M., Freiman G. A., and Galil Z., Solving Dense Subset-Sum Problem by Using Analytical Number Theory, J. of Complexity, 5, 1989, 271-282. | MR | Zbl | DOI

[7] Erdős P., and Freiman G., On Two Additive Problems, J. Number Theory, 34, 1990, 1-12. | MR | Zbl | DOI

[8] Freiman G. A., An Analytical Method of Analysis of Linear Boolean Equations, Ann. New York Acad. Sci., 337, 1980, 97-102. | MR | Zbl | DOI

[9] Freiman G. A., Subset-Sum Problem with Different Summands, Congressus Numerantium, 70, 1990, 207-215. | MR | Zbl

[10] Freiman G. A., New Analytical Results in Subset-Sum Problem, Discrete Mathematics, 114, 1993, 205-218. | MR | Zbl | DOI

[11] Galil Z., and Margalit O., An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem, SIAM J. of Computing, 20, 1991, 1157-1189. | MR | Zbl | DOI

[12] Lipkin E., On Representation of r-Powers by Subset-Sums, Acta Arithmetica, LII, 1989, 353-366. | MR | Zbl | EuDML | DOI

[13] Martello S. and Toth T., The 0-1 Knapsack Problem, in Combinatorial Optimization, ed : N. Christofides, A.Mingozzi, P. Toth, C.Sandi, Wiley, 1979, 237-279. | MR | Zbl

[14] Olson J., An Addition Theorem Modulo p, J. of Combinatorial Theory, 5, 1968, 45-52. | MR | Zbl | DOI

[15] Sárközy A., Finite Addition Theorems II, J. Number Theory, 48, 1994, 197-218. | MR | Zbl | DOI