@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}, publisher = {Soci\'et\'e math\'ematique de France}, number = {258}, year = {1999}, mrnumber = {1701210}, zbl = {0987.90061}, language = {en}, url = {http://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 - http://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 http://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, in Structure theory of set addition, Astérisque, no. 258 (1999), pp. 363-373. http://www.numdam.org/item/AST_1999__258__363_0/
[1] On Sums of Subsets of a Set of Integers, Combinatorica, 8, 1988, 305-314. | DOI | MR | Zbl
, and ,[2] Analytical Methods in Integer Programming, Moscow, ZEMJ., (Russian), 1980, 48 pp.
, and ,[3] An Efficient Algorithm for the Subset-Sum Problem, a manuscript, 1988.
,[4] Subset-Sum Problems with Different Summands : Computation, Discrete Applied Mathematics, 27, 1990, 277-282. | DOI | MR | Zbl
,[5] Solving a Value-Independent Knapsack Problem with the Use of Methods of Additive Number Theory, Congressus Numerantium, 72, 1990, 115-123. | MR | Zbl
,[6] Solving Dense Subset-Sum Problem by Using Analytical Number Theory, J. of Complexity, 5, 1989, 271-282. | DOI | MR | Zbl
, , and ,[7] On Two Additive Problems, J. Number Theory, 34, 1990, 1-12. | DOI | MR | Zbl
, and ,[8] An Analytical Method of Analysis of Linear Boolean Equations, Ann. New York Acad. Sci., 337, 1980, 97-102. | DOI | MR | Zbl
,[9] Subset-Sum Problem with Different Summands, Congressus Numerantium, 70, 1990, 207-215. | MR | Zbl
,[10] New Analytical Results in Subset-Sum Problem, Discrete Mathematics, 114, 1993, 205-218. | DOI | MR | Zbl
,[11] An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem, SIAM J. of Computing, 20, 1991, 1157-1189. | DOI | MR | Zbl
, and ,[12] On Representation of -Powers by Subset-Sums, Acta Arithmetica, LII, 1989, 353-366. | DOI | EuDML | MR | Zbl
,[13] The Knapsack Problem, in Combinatorial Optimization, ed : N. Christofides, A.Mingozzi, P. Toth, C.Sandi, Wiley, 1979, 237-279. | MR | Zbl
and ,[14] An Addition Theorem Modulo , J. of Combinatorial Theory, 5, 1968, 45-52. | DOI | MR | Zbl
,[15] Finite Addition Theorems II, J. Number Theory, 48, 1994, 197-218. | DOI | MR | Zbl
,