论文信息 - An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem

This paper describes a new approach for solving a large subproblem of the subset-sum problem. It is useful for solving other NP-hard integer programming problems. The limits and potential of this approach are investigated.

Zvi Galil | Oded Margalit

[1] András Sárközy,et al. Finite addition theorems, I , 1989 .

[2] Gregory A. Freiman,et al. On two additive problems , 1990 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] G. Dantzig. Discrete-Variable Extremum Problems , 1957 .

[5] Gregory A. Freiman. AN ANALYTICAL METHOD OF ANALYSIS OF LINEAR BOOLEAN EQUATIONS , 1980 .

[6] E. Lipkin. On representation of r-th powers by subset sums , 1989 .

[7] Zvi Galil,et al. Solving dense subset-sum problems by using analytical number theory , 1989, J. Complex..

[8] Jeffrey C. Lagarias,et al. Solving Low-Density Subset Sum Problems , 1983, FOCS.

[9] Moni Naor,et al. Efficient cryptographic schemes provably as secure as subset sum , 1989, 30th Annual Symposium on Foundations of Computer Science.

[10] Noga Alon,et al. On sums of subsets of a set of integers , 1988, Comb..