Solving dense subset-sum problems by using analytical number theory

Mark Chaimovich; Gregory Freiman; Zvi Galil

doi:10.1016/0885-064X(89)90025-3

Solving dense subset-sum problems by using analytical number theory

Mark Chaimovich^*, Gregory Freiman, Zvi Galil

^*Corresponding author for this work

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

Theorems from analytical number theory are used to derive new algorithms for the subset-sum problem. The algorithms work for a large number of variables (m) with values that are bounded above. The bound (l) depends moderately on m. While the dynamic programming approach yields an O(lm²) algorithm, the new algorithms are substantially faster.

Original language	English
Pages (from-to)	271-282
Number of pages	12
Journal	Journal of Complexity
Volume	5
Issue number	3
DOIs	https://doi.org/10.1016/0885-064X(89)90025-3
State	Published - Sep 1989

Access to Document

10.1016/0885-064X(89)90025-3

Cite this

@article{d92fe1ebf1d0430abb2e3a7addc7ef6f,

title = "Solving dense subset-sum problems by using analytical number theory",

abstract = "Theorems from analytical number theory are used to derive new algorithms for the subset-sum problem. The algorithms work for a large number of variables (m) with values that are bounded above. The bound (l) depends moderately on m. While the dynamic programming approach yields an O(lm2) algorithm, the new algorithms are substantially faster.",

author = "Mark Chaimovich and Gregory Freiman and Zvi Galil",

year = "1989",

month = sep,

doi = "10.1016/0885-064X(89)90025-3",

language = "אנגלית",

volume = "5",

pages = "271--282",

journal = "Journal of Complexity",

issn = "0885-064X",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Solving dense subset-sum problems by using analytical number theory

AU - Chaimovich, Mark

AU - Freiman, Gregory

AU - Galil, Zvi

PY - 1989/9

Y1 - 1989/9

N2 - Theorems from analytical number theory are used to derive new algorithms for the subset-sum problem. The algorithms work for a large number of variables (m) with values that are bounded above. The bound (l) depends moderately on m. While the dynamic programming approach yields an O(lm2) algorithm, the new algorithms are substantially faster.

AB - Theorems from analytical number theory are used to derive new algorithms for the subset-sum problem. The algorithms work for a large number of variables (m) with values that are bounded above. The bound (l) depends moderately on m. While the dynamic programming approach yields an O(lm2) algorithm, the new algorithms are substantially faster.

UR - http://www.scopus.com/inward/record.url?scp=38249005080&partnerID=8YFLogxK

U2 - 10.1016/0885-064X(89)90025-3

DO - 10.1016/0885-064X(89)90025-3

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38249005080

SN - 0885-064X

VL - 5

SP - 271

EP - 282

JO - Journal of Complexity

JF - Journal of Complexity

IS - 3

ER -

Solving dense subset-sum problems by using analytical number theory

Abstract

Access to Document

Other files and links

Fingerprint

Cite this