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

This paper describes a new approach for solving the subset-sum problem. It is useful for solving other NP-hard problems. The limits and potential of this approach are discussed. The approach yields an algorithm for solving the dense version of the subset-sum problem. It runs in time $O(\ell \log \el...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on computing Ročník 20; číslo 6; s. 1157 - 1189
Hlavní autoři: Galil, Zvi, Margalit, Oded
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1991
Témata:
Algorithms
Approximation
Classical combinatorial problems
Combinatorics
Combinatorics. Ordered structures
Computer science
Dynamic programming
Exact sciences and technology
Integer programming
Mathematics
Sciences and techniques of general use
Integer
Integer programming
Partition
Algorithm complexity
NP hard problem
Combinatory problem
Progression arithmétique
ISSN:0097-5397, 1095-7111
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract This paper describes a new approach for solving the subset-sum problem. It is useful for solving other NP-hard problems. The limits and potential of this approach are discussed. The approach yields an algorithm for solving the dense version of the subset-sum problem. It runs in time $O(\ell \log \ell )$, where $\ell $ is the bound on the size of the elements. But for dense enough inputs and target numbers near the middle sum, it runs in time $O(m)$, where $m$ is the number of elements. Consequently, it improves the previously best algorithms by at least one order of magnitude and sometimes by two. The algorithm yields a characterization of the set of subset sums as a collection of arithmetic progressions with the same difference. This characterization is derived by elementary number-theoretic and algorithmic techniques. Such a characterization was first obtained by using analytic number theory and yielded inferior algorithms.
AbstractList This paper describes a new approach for solving the subset-sum problem. It is useful for solving other NP-hard problems. The limits and potential of this approach are discussed. The approach yields an algorithm for solving the dense version of the subset-sum problem. It runs in time $O(\ell \log \ell )$, where $\ell $ is the bound on the size of the elements. But for dense enough inputs and target numbers near the middle sum, it runs in time $O(m)$, where $m$ is the number of elements. Consequently, it improves the previously best algorithms by at least one order of magnitude and sometimes by two. The algorithm yields a characterization of the set of subset sums as a collection of arithmetic progressions with the same difference. This characterization is derived by elementary number-theoretic and algorithmic techniques. Such a characterization was first obtained by using analytic number theory and yielded inferior algorithms.
Author Galil, Zvi
Margalit, Oded
Author_xml – sequence: 1
  givenname: Zvi
  surname: Galil
  fullname: Galil, Zvi
– sequence: 2
  givenname: Oded
  surname: Margalit
  fullname: Margalit, Oded
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5110484$$DView record in Pascal Francis
BookMark eNpl0F9LwzAUBfAgCm5T_ApFBJ-i9zbp0rw55l8YKGw-lyxNXEebzCR98Ntb2fBBnw4cftwLZ0yOnXeGkAuEG0QmbiHPAUR-REYIsqACEY_JCEAKWjApTsk4xi0Aco5sRO5mLpu1nY8pWzTOqEBXTWeG6sOHJm26zPqQpY3J7o2LJlv262gSXfZd9hb8ujXdGTmxqo3m_JAT8v74sJo_08Xr08t8tqCa8SJRraUqrZVGcpzK0k4LUedSgWa5FVLlNSuhzmvFmVkDNxy5EiVKxhG0FJyxCbnc390F_9mbmKqt74MbXlYSpcCiEDCgqwNSUavWBuV0E6tdaDoVvqoCEXjJB3a9Zzr4GIOxvwKh-hmxOow4SPpH6iap1HiXgmraf_4bpoxw7w
CitedBy_id crossref_primary_10_1016_j_ffa_2019_101607
crossref_primary_10_1016_j_jnt_2003_08_009
crossref_primary_10_1137_24M1686772
crossref_primary_10_1007_s11139_018_0020_0
crossref_primary_10_1016_j_jcss_2022_01_005
crossref_primary_10_1145_3329863
crossref_primary_10_1007_BF00189260
Cites_doi 10.1287/opre.5.2.266
10.1111/j.1749-6632.1980.tb18009.x
10.4064/aa-52-4-353-365
10.1016/0166-218X(90)90071-J
10.1016/0885-064X(89)90025-3
10.1016/0022-314X(90)90047-U
10.1007/BF02189086
10.1006/jnth.1994.1062
ContentType Journal Article
Copyright 1992 INIST-CNRS
[Copyright] © 1991 © Society for Industrial and Applied Mathematics
Copyright_xml – notice: 1992 INIST-CNRS
– notice: [Copyright] © 1991 © Society for Industrial and Applied Mathematics
DBID AAYXX
CITATION
IQODW
3V.
7RQ
7WY
7WZ
7X2
7XB
87Z
88A
88F
88I
88K
8AL
8FE
8FG
8FH
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
CCPQU
D1I
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
KB.
L.-
L6V
LK8
M0C
M0K
M0N
M1Q
M2O
M2P
M2T
M7P
M7S
MBDVC
P5Z
P62
PATMY
PDBOC
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
PYCSY
Q9U
S0W
U9A
DOI 10.1137/0220072
DatabaseName CrossRef
Pascal-Francis
ProQuest Central (Corporate)
Career & Technical Education Database (ProQuest)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Agricultural Science Collection
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Biology Database (Alumni Edition)
Military Database (Alumni Edition)
Science Database (Alumni Edition)
Telecommunications (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
Agricultural & Environmental Science Collection
ProQuest Central Essentials
ProQuest SciTech Premium Collection Natural Science Collection Biological Science Collection
ProQuest Central
ProQuest Business Premium Collection
ProQuest Technology Collection
Natural Science Collection
ProQuest One
ProQuest Materials Science Collection
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
ProQuest Research Library
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
Materials Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Biological Sciences
ABI/INFORM Global
Agricultural Science Database
Computing Database
Military Database (ProQuest)
Research Library
Science Database
Telecommunications Database
Biological Science Database
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Environmental Science Database
Materials Science Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
Environmental Science Collection
ProQuest Central Basic
DELNET Engineering & Technology Collection
DatabaseTitle CrossRef
Agricultural Science Database
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Military Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest Telecommunications
ProQuest One Applied & Life Sciences
Natural Science Collection
Biological Science Collection
ProQuest Central (New)
Engineering Collection
Career and Technical Education (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
Agricultural Science Collection
ProQuest Technology Collection
ProQuest Telecommunications (Alumni Edition)
Biological Science Database
ProQuest Business Collection
Environmental Science Collection
ProQuest Career and Technical Education
ProQuest One Academic UKI Edition
Environmental Science Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
Materials Science Collection
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Natural Science Collection
ProQuest Biology Journals (Alumni Edition)
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
Agricultural & Environmental Science Collection
Materials Science Database
ProQuest Research Library
ABI/INFORM Complete (Alumni Edition)
ProQuest Materials Science Collection
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest Military Collection (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest DELNET Engineering and Technology Collection
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList Agricultural Science Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1095-7111
EndPage 1189
ExternalDocumentID 2577804871
5110484
10_1137_0220072
GroupedDBID --Z
-DZ
-~X
.4S
.DC
123
4.4
7RQ
7WY
7X2
7XC
88I
8CJ
8FE
8FG
8FH
8FL
8G5
8V8
AALVN
AASXH
AAYXX
ABDBF
ABDPE
ABJCF
ABKAD
ABMZU
ABPPZ
ABUFD
ABUWG
ACBEA
ACGFO
ACGOD
ACIWK
ACNCT
ACPRK
ACUHS
ADBBV
ADMHC
ADXHL
AEMOZ
AENEX
AFFHD
AFKRA
AFRAH
AHQJS
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ANXRF
ARAPS
ARCSS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
BPHCQ
CCPQU
CITATION
CS3
CZ9
D1I
D1J
D1K
DQ2
DU5
DWQXO
EAP
EAS
EBR
EBS
EBU
ECS
EDO
EJD
EMK
EST
ESX
FRNLG
GNUQQ
GUQSH
H13
HCIFZ
H~9
I-F
K1G
K6-
K60
K6V
K6~
K7-
KB.
KC.
L6V
LK5
LK8
M0C
M0K
M1Q
M2O
M2P
M7P
M7R
M7S
MK~
NHB
OHT
P1Q
P2P
P62
PATMY
PDBOC
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PTHSS
PYCSY
RJG
RNS
RSI
S0W
TAE
TH9
TN5
TUS
TWZ
UHB
UQL
VOH
WH7
WHG
XJE
YNT
YYP
YZZ
ZCG
ZY4
IQODW
XJT
3V.
7XB
88A
88K
8AL
8FK
JQ2
L.-
M0N
M2T
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
U9A
ID FETCH-LOGICAL-c345t-cc9a8ff9e941698f657d29a0c32f79a2d380d2da43eb04e414a78193410c97433
IEDL.DBID M0C
ISICitedReferencesCount 32
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1137_0220072&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0097-5397
IngestDate Fri Jul 25 11:16:29 EDT 2025
Mon Jul 21 09:18:21 EDT 2025
Sat Nov 29 03:54:32 EST 2025
Tue Nov 18 21:45:00 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords Integer
Integer programming
Partition
Algorithm complexity
NP hard problem
Combinatory problem
Progression arithmétique
Language English
License CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c345t-cc9a8ff9e941698f657d29a0c32f79a2d380d2da43eb04e414a78193410c97433
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
PQID 919715570
PQPubID 666313
PageCount 33
ParticipantIDs proquest_journals_919715570
pascalfrancis_primary_5110484
crossref_primary_10_1137_0220072
crossref_citationtrail_10_1137_0220072
PublicationCentury 1900
PublicationDate 1991-12-01
PublicationDateYYYYMMDD 1991-12-01
PublicationDate_xml – month: 12
  year: 1991
  text: 1991-12-01
  day: 01
PublicationDecade 1990
PublicationPlace Philadelphia, PA
PublicationPlace_xml – name: Philadelphia, PA
– name: Philadelphia
PublicationTitle SIAM journal on computing
PublicationYear 1991
Publisher Society for Industrial and Applied Mathematics
Publisher_xml – name: Society for Industrial and Applied Mathematics
References R2
R6
R7
R8
R9
Freiman Gregory A. (R11) 1988; 26
Garey Michael R. (R14) 1979
Berstein A. A. (R3) 1979
R10
R18
Freiman G. A. (R12) 1990; 70
Lipkin E. (R17) 1989; 52
R1
References_xml – ident: R8
  doi: 10.1287/opre.5.2.266
– volume: 70
  start-page: 207
  year: 1990
  ident: R12
  publication-title: Congr. Numer.
– ident: R10
  doi: 10.1111/j.1749-6632.1980.tb18009.x
– volume: 52
  start-page: 353
  year: 1989
  ident: R17
  publication-title: Acta Arith.
  doi: 10.4064/aa-52-4-353-365
– ident: R6
  doi: 10.1016/0166-218X(90)90071-J
– volume: 26
  start-page: 93
  year: 1988
  ident: R11
  publication-title: Ars Combin.
– ident: R7
  doi: 10.1016/0885-064X(89)90025-3
– ident: R9
  doi: 10.1016/0022-314X(90)90047-U
– ident: R1
– ident: R2
  doi: 10.1007/BF02189086
– start-page: 89
  year: 1979
  ident: R3
  publication-title: ZEMJ
– volume-title: Computers and intractability
  year: 1979
  ident: R14
– ident: R18
  doi: 10.1006/jnth.1994.1062
SSID ssj0014413
Score 1.5224364
Snippet This paper describes a new approach for solving the subset-sum problem. It is useful for solving other NP-hard problems. The limits and potential of this...
SourceID proquest
pascalfrancis
crossref
SourceType Aggregation Database
Index Database
Enrichment Source
StartPage 1157
SubjectTerms Algorithms
Approximation
Classical combinatorial problems
Combinatorics
Combinatorics. Ordered structures
Computer science
Dynamic programming
Exact sciences and technology
Integer programming
Mathematics
Sciences and techniques of general use
Title An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
URI https://www.proquest.com/docview/919715570
Volume 20
WOSCitedRecordID wos10_1137_0220072&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: 7WY
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M0C
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: P5Z
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Agricultural Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M0K
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/agriculturejournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Biological Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M7P
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/biologicalscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Career & Technical Education Database (ProQuest)
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: 7RQ
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/career
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: K7-
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M7S
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Environmental Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: PATMY
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/environmentalscience
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Materials Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: KB.
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/materialsscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Military Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M1Q
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/military
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: BENPR
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Research Library
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M2O
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1095-7111
  dateEnd: 20140531
  omitProxy: false
  ssIdentifier: ssj0014413
  issn: 0097-5397
  databaseCode: M2P
  dateStart: 19720301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB7RlgMVolCo2JaufKh6MySxXccn2JZWSNVu0weicIkSxwGk7oMm7e9nxvFGqipx4fIpj1ESZex5-PENwF5Zlsa4RPHIScGliS3HKD_maYW-RVTYQsrUF5vQk0l6fW2ysDanCcsqlzbRG-pqbmmM_IOJjY6JL-rj4g-nolE0uRoqaKzAGgU2RJ0_jo76SQT09IGEUnOFfrfbMxvHROmT0Bhd8sAZPV8UDf6Xuito8cg2e4dzsvGfn_oSXoRIk426pvEKnrjZJmwsqziw0Kk3YX3cM7c2r-HTaMZGN9N50zJMU7EbcNokgpd-4ivaX1OGQS5DefYZ81_HyO64ll_eTVnWlaZ5A19Pjq-OvvBQZYFbIVXLrTVFWtfGGYzNTFofKI16KiIrklqbIqlEGlVJVUjhykg6GctCYxiB3i-ymIwIsQWrs_nMvQVGXHKKCHRc6qQt6cHiICqtVqouC6UGsL_83bkNFORUCeMm96mI0HnQywBYL7joWDcei-w-0FcvhxEkWiU5gJ2lcvLQLZu818z2P-_uwDO_IsyvWnkHq-3tnduFp_a-_d3cDmFFX5wTfvs-hLXD40l2gWenmhMevh_6RujxlDAm2XFy5jHzeEWo_bG-RMzUj78gE-RX
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Na9wwEB3S3UJTSrbdJnS7-dAh3ZuILUtr61CISRqyJLssZAvpybVluQnsV2KnpT-q_7EjWzaEQG859GoPtmU9ZkbSzHsAh0mSSKmZoI7mHuXSVRSzfJcGKcYWL0WEJEEpNuFPJsH1tZxuwJ-6F8aUVdY-sXTU6UqZPfIj6UrfNXxRtoDyQv_-hcuz_PPoFOfyE2NnX2Yn59QqCFDlcVFQpWQcZJnUEvMOGWRD4eM3xI7yWObLmKVe4KQsjbmnE4dr7vLYxxCJnt1RmGibzU42WN9RI1JlDnOtYscLaAemAbQF7Wk4G39rji0wt7C0lz4VGOmrLl3XNSRCzOwKskfh7806znEmskpC40k0KEPcWec_-zlvYcvm0iSswP8ONvSyC51ap4JYt9WF1-OGmzZ_D8fhkoTzxSovCC7EcSDUtMHgpR_4iuJmQTCNJ2hPTnGFr4nxrLqgVw8LMq3Ed7bh67MMdAday9VSfwBi2PKEoQjSgeYqMQ_2hk6ifCGyJBaiB4N6eiNlSdaN1sc8Khdbnh9ZHPSANIbrilfkqcneI3w0dpgjo9_lPejXYIis48mjBgkf_3n3AF6dz8aX0eVoctGHzbL-razR2YVWcf-g9-Cl-lnc5vf7FuIEvj83lv4CaTA0Sw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+almost+linear-time+algorithm+for+the+dense+subset-sum+problem&rft.jtitle=SIAM+journal+on+computing&rft.au=GALIL%2C+Z&rft.au=MARGALIT%2C+O&rft.date=1991-12-01&rft.pub=Society+for+Industrial+and+Applied+Mathematics&rft.issn=0097-5397&rft.volume=20&rft.issue=6&rft.spage=1157&rft.epage=1189&rft_id=info:doi/10.1137%2F0220072&rft.externalDBID=n%2Fa&rft.externalDocID=5110484
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0097-5397&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0097-5397&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0097-5397&client=summon