{"id":"https://openalex.org/W2952672079","doi":"https://doi.org/10.1145/3329863","title":"Faster Pseudopolynomial Time Algorithms for Subset Sum","display_name":"Faster Pseudopolynomial Time Algorithms for Subset Sum","publication_year":2019,"publication_date":"2019-06-12","ids":{"openalex":"https://openalex.org/W2952672079","doi":"https://doi.org/10.1145/3329863","mag":"2952672079"},"language":"en","primary_location":{"id":"doi:10.1145/3329863","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3329863","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5048262263","display_name":"Konstantinos Koiliaris","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Konstantinos Koiliaris","raw_affiliation_strings":["University of Illinois, Urbana-Champaign, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081196371","display_name":"Chao Xu","orcid":"https://orcid.org/0000-0003-4417-3299"},"institutions":[{"id":"https://openalex.org/I4210133173","display_name":"Research!America (United States)","ror":"https://ror.org/044pgyv50","country_code":"US","type":"company","lineage":["https://openalex.org/I4210133173"]},{"id":"https://openalex.org/I4210134091","display_name":"Yahoo (United States)","ror":"https://ror.org/040dkzz12","country_code":"US","type":"company","lineage":["https://openalex.org/I4210134091"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chao Xu","raw_affiliation_strings":["Yahoo! Research, New York, NY, USA"],"raw_orcid":"https://orcid.org/0000-0003-4417-3299","affiliations":[{"raw_affiliation_string":"Yahoo! Research, New York, NY, USA","institution_ids":["https://openalex.org/I4210133173","https://openalex.org/I4210134091"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048262263"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":5.0537,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.95748778,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"15","issue":"3","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9969000220298767,"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/modulo","display_name":"Modulo","score":0.8060997724533081},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6407296061515808},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6187347173690796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5827850699424744},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5121833682060242},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.5028485655784607},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4924515187740326},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.45358967781066895},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4513671398162842},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43356946110725403},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4219067394733429},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4191412329673767},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4182455241680145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3117312788963318}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.8060997724533081},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6407296061515808},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6187347173690796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5827850699424744},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5121833682060242},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.5028485655784607},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4924515187740326},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.45358967781066895},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4513671398162842},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43356946110725403},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4219067394733429},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4191412329673767},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4182455241680145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3117312788963318},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3329863","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3329863","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.7599999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W593489687","https://openalex.org/W787742013","https://openalex.org/W971488519","https://openalex.org/W1168421410","https://openalex.org/W1498486822","https://openalex.org/W1519164784","https://openalex.org/W1539628364","https://openalex.org/W1709275931","https://openalex.org/W1832165767","https://openalex.org/W1966986652","https://openalex.org/W1974882000","https://openalex.org/W1984863471","https://openalex.org/W1985572324","https://openalex.org/W1992558436","https://openalex.org/W2004450282","https://openalex.org/W2019300924","https://openalex.org/W2044474025","https://openalex.org/W2045492613","https://openalex.org/W2045789201","https://openalex.org/W2048068744","https://openalex.org/W2054174464","https://openalex.org/W2060322444","https://openalex.org/W2065311094","https://openalex.org/W2065982392","https://openalex.org/W2069650774","https://openalex.org/W2076844787","https://openalex.org/W2085888776","https://openalex.org/W2113195911","https://openalex.org/W2118363183","https://openalex.org/W2128203754","https://openalex.org/W2138090566","https://openalex.org/W2141305408","https://openalex.org/W2144105164","https://openalex.org/W2147036787","https://openalex.org/W2548462069","https://openalex.org/W2561675875","https://openalex.org/W2795466116","https://openalex.org/W2884311720","https://openalex.org/W2949628502","https://openalex.org/W2951283560","https://openalex.org/W2964005479","https://openalex.org/W3102833860","https://openalex.org/W3121454643","https://openalex.org/W3145128584","https://openalex.org/W3175367423","https://openalex.org/W4206899940","https://openalex.org/W4233225156","https://openalex.org/W4234361933","https://openalex.org/W4372267129","https://openalex.org/W4389255160","https://openalex.org/W6632972792","https://openalex.org/W6858910803"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W3100139999","https://openalex.org/W2113270940","https://openalex.org/W4252842032","https://openalex.org/W2900627138"],"abstract_inverted_index":{"Given":[0],"a":[1,10,25,37,85,168],"(multi)":[2],"set":[3],"S":[4,28,76],"of":[5,27,39,72,75,133,178],"n":[6,60,106],"positive":[7],"integers":[8,89],"and":[9,44,77],"target":[11],"integer":[12,54],"u":[13,33,55,61,63],",":[14,62,92,108,174],"the":[15,47,53,70,96,117,131,136,140],"subset":[16,26,49,98],"sum":[17,71],"problem":[18],"is":[19,24,69],"to":[20,32,52,160],"decide":[21],"if":[22],"there":[23],"that":[29,42,122],"sums":[30,50,99],"up":[31,51],".":[34],"We":[35,82],"present":[36,84],"series":[38],"new":[40,137,148],"algorithms":[41,138,143],"compute":[43],"return":[45],"all":[46,73,95],"realizable":[48,97],"in":[56,102,124,153],"\u00d5(min":[57,103],"{":[58,104],"\u221a":[59,105],"5/4":[64,110],",\u03c3":[65],"}),":[66],"where":[67],"\u03c3":[68],"elements":[74],"\u00d5":[78],"hides":[79],"polylogarithmic":[80],"factors.":[81],"also":[83,166],"modified":[86],"algorithm":[87,121],"for":[88,144],"modulo":[90,100],"m":[91,101,107,109,173],"which":[93,175],"computes":[94],"})":[111],"time.":[112,129],"Our":[113],"contributions":[114],"improve":[115,167],"upon":[116],"standard":[118],"dynamic":[119],"programming":[120],"runs":[123],"O":[125],"(":[126],"nu":[127],")":[128],"To":[130],"best":[132],"our":[134],"knowledge,":[135],"are":[139],"fastest":[141],"deterministic":[142],"this":[145],"problem.":[146],"The":[147],"results":[149],"can":[150],"be":[151,177],"employed":[152],"various":[154],"algorithmic":[155],"problems,":[156],"from":[157],"graph":[158],"bipartition":[159],"computational":[161],"social":[162],"choice.":[163],"Finally,":[164],"we":[165],"result":[169],"on":[170],"covering":[171],"Z":[172],"might":[176],"independent":[179],"interest.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}