{"id":"https://openalex.org/W2069650774","doi":"https://doi.org/10.1137/0220072","title":"An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem","display_name":"An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem","publication_year":1991,"publication_date":"1991-12-01","ids":{"openalex":"https://openalex.org/W2069650774","doi":"https://doi.org/10.1137/0220072","mag":"2069650774"},"language":"en","primary_location":{"id":"doi:10.1137/0220072","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220072","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048955152","display_name":"Zvi Galil","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Zvi Galil","raw_affiliation_strings":["Columbia Univ. New York, NY and Tel Aviv Univ., Tel Aviv, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Columbia Univ. New York, NY and Tel Aviv Univ., Tel Aviv, Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059227880","display_name":"Oded Margalit","orcid":"https://orcid.org/0000-0002-2026-2601"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Oded Margalit","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048955152"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.24819554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"6","first_page":"1157","last_page":"1189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7282061576843262},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.6475729942321777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5435701012611389},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.5342833995819092},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4813995361328125},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4755627512931824},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47141051292419434},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.46903833746910095},{"id":"https://openalex.org/keywords/analysis-of-algorithms","display_name":"Analysis of algorithms","score":0.44987690448760986},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43985849618911743},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4271915853023529},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1725771427154541}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7282061576843262},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.6475729942321777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5435701012611389},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.5342833995819092},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4813995361328125},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4755627512931824},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47141051292419434},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.46903833746910095},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.44987690448760986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43985849618911743},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4271915853023529},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1725771427154541},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220072","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220072","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1000332906","https://openalex.org/W2005166330","https://openalex.org/W2011039300","https://openalex.org/W2016477241","https://openalex.org/W2032467110","https://openalex.org/W2056109379","https://openalex.org/W2060322444","https://openalex.org/W2060364819","https://openalex.org/W2076729819","https://openalex.org/W2079212748","https://openalex.org/W2080188430","https://openalex.org/W2148695585"],"related_works":["https://openalex.org/W3107994849","https://openalex.org/W4247143848","https://openalex.org/W2009883749","https://openalex.org/W2735573198","https://openalex.org/W29442446","https://openalex.org/W3116226859","https://openalex.org/W4301041047","https://openalex.org/W2093776691","https://openalex.org/W3200183883","https://openalex.org/W2069650774"],"abstract_inverted_index":{"This":[0,125],"paper":[1],"describes":[2],"a":[3,107,116,136],"new":[4],"approach":[5,25,29],"for":[6,14,33,63],"solving":[7,15,34],"the":[8,35,39,54,57,60,71,82,89,110,122],"subset-sum":[9,40],"problem.":[10,41],"It":[11,42],"is":[12,53,81,127],"useful":[13],"other":[16],"NP-hard":[17],"problems.":[18],"The":[19,28,104],"limits":[20],"and":[21,67,100,132,146],"potential":[22],"of":[23,38,59,84,98,109,112,118],"this":[24],"are":[26],"discussed.":[27],"yields":[30,106],"an":[31],"algorithm":[32,105],"dense":[36,64],"version":[37],"runs":[43,75],"in":[44,76],"time":[45,77],"$O(\\ell":[46],"\\log":[47],"\\ell":[48],")$,":[49],"where":[50,79],"$\\ell":[51],"$":[52],"bound":[55],"on":[56],"size":[58],"elements.":[61,85],"But":[62],"enough":[65],"inputs":[66],"target":[68],"numbers":[69],"near":[70],"middle":[72],"sum,":[73],"it":[74,87],"$O(m)$,":[78],"m":[80],"number":[83,144],"Consequently,":[86],"improves":[88],"previously":[90],"best":[91],"algorithms":[92],"by":[93,102,129,141],"at":[94],"least":[95],"one":[96],"order":[97],"magnitude":[99],"sometimes":[101],"two.":[103],"characterization":[108,126,137],"set":[111],"subset":[113],"sums":[114],"as":[115],"collection":[117],"arithmetic":[119],"progressions":[120],"with":[121],"same":[123],"difference.":[124],"derived":[128],"elementary":[130],"number-theoretic":[131],"algorithmic":[133],"techniques.":[134],"Such":[135],"was":[138],"first":[139],"obtained":[140],"using":[142],"analytic":[143],"theory":[145],"yielded":[147],"inferior":[148],"algorithms.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}