{"id":"https://openalex.org/W3035306598","doi":"https://doi.org/10.1145/3357713.3384308","title":"Top-\ud835\udc58-convolution and the quest for near-linear output-sensitive subset sum","display_name":"Top-\ud835\udc58-convolution and the quest for near-linear output-sensitive subset sum","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3035306598","doi":"https://doi.org/10.1145/3357713.3384308","mag":"3035306598"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384308","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384308","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384308","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384308","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Saarland University, Germany / MPI-INF, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Germany / MPI-INF, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054359620","display_name":"Vasileios Nakos","orcid":"https://orcid.org/0000-0003-2703-2750"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vasileios Nakos","raw_affiliation_strings":["Saarland University, Germany / MPI-INF, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Germany / MPI-INF, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7056,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.94077253,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"982","last_page":"995"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/set","display_name":"Set (abstract data type)","score":0.739870548248291},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6913756728172302},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.685860276222229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5571884512901306},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.5551384687423706},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5445932745933533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4866362512111664},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.48076626658439636},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.480699360370636},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4507076144218445},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43497008085250854},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41943150758743286},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3910413980484009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3783007264137268},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21643900871276855}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.739870548248291},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6913756728172302},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.685860276222229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5571884512901306},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.5551384687423706},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5445932745933533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4866362512111664},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.48076626658439636},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.480699360370636},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4507076144218445},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43497008085250854},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41943150758743286},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3910413980484009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3783007264137268},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21643900871276855},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384308","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384308","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384308","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384308","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384308","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384308","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5279399150","display_name":"Technology Transfer between Integer Programming and Efficient Algorithms","funder_award_id":"850979","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3035306598.pdf","grobid_xml":"https://content.openalex.org/works/W3035306598.grobid-xml"},"referenced_works_count":65,"referenced_works":["https://openalex.org/W41804080","https://openalex.org/W254944847","https://openalex.org/W787742013","https://openalex.org/W1480447816","https://openalex.org/W1787126581","https://openalex.org/W1847405718","https://openalex.org/W1969941659","https://openalex.org/W1989204408","https://openalex.org/W1996113955","https://openalex.org/W2012632515","https://openalex.org/W2031683606","https://openalex.org/W2033042165","https://openalex.org/W2038073775","https://openalex.org/W2045492613","https://openalex.org/W2056559482","https://openalex.org/W2066671865","https://openalex.org/W2074196013","https://openalex.org/W2094090625","https://openalex.org/W2106287110","https://openalex.org/W2120248756","https://openalex.org/W2134863191","https://openalex.org/W2139087151","https://openalex.org/W2142247058","https://openalex.org/W2164920129","https://openalex.org/W2217165386","https://openalex.org/W2252401345","https://openalex.org/W2274447119","https://openalex.org/W2290722161","https://openalex.org/W2341171179","https://openalex.org/W2401610261","https://openalex.org/W2404960361","https://openalex.org/W2537252502","https://openalex.org/W2540137001","https://openalex.org/W2564022051","https://openalex.org/W2607384713","https://openalex.org/W2773806639","https://openalex.org/W2788799008","https://openalex.org/W2884311720","https://openalex.org/W2888300904","https://openalex.org/W2949628502","https://openalex.org/W2951007762","https://openalex.org/W2951283560","https://openalex.org/W2952438738","https://openalex.org/W2952836368","https://openalex.org/W2963053963","https://openalex.org/W2963538656","https://openalex.org/W2963906549","https://openalex.org/W2964026456","https://openalex.org/W2964549137","https://openalex.org/W3018936433","https://openalex.org/W3098395151","https://openalex.org/W3102065507","https://openalex.org/W3102216609","https://openalex.org/W3162572584","https://openalex.org/W3217451041","https://openalex.org/W4205426033","https://openalex.org/W4238269894","https://openalex.org/W4251436657","https://openalex.org/W4253314034","https://openalex.org/W4289105980","https://openalex.org/W4293578211","https://openalex.org/W4294583887","https://openalex.org/W4298201387","https://openalex.org/W4300485501","https://openalex.org/W4301958294"],"related_works":["https://openalex.org/W2950809114","https://openalex.org/W4387838477","https://openalex.org/W961142965","https://openalex.org/W3139422612","https://openalex.org/W3116226859","https://openalex.org/W4399652722","https://openalex.org/W4301041047","https://openalex.org/W4401922739","https://openalex.org/W2093776691","https://openalex.org/W3200183883"],"abstract_inverted_index":{"In":[0],"the":[1,16,53,56,70,96],"classical":[2],"SubsetSum":[3],"problem":[4],"we":[5],"are":[6,46,79],"given":[7],"a":[8,12,24,89],"set":[9,71,98],"X":[10,27,77],"and":[11,15],"target":[13],"t,":[14],"task":[17],"is":[18,69],"to":[19,30],"decide":[20],"whether":[21],"there":[22],"exists":[23],"subset":[25,74],"of":[26,35,72,76],"which":[28,45],"sums":[29,75],"t.":[31,82],"A":[32],"recent":[33],"line":[34],"research":[36],"has":[37],"resulted":[38],"in":[39,62],"(t":[40],"\u00b7":[41,65],"poly":[42],"(logt))-time":[43],"algorithms,":[44],"(near-)optimal":[47],"under":[48],"popular":[49],"complexity-theoretic":[50],"assumptions.":[51],"On":[52],"other":[54],"hand,":[55],"standard":[57],"dynamic":[58],"programming":[59],"algorithm":[60],"runs":[61],"time":[63],"O(n":[64],"|S(X,t)|),":[66],"where":[67],"S(X,t)":[68],"all":[73],"that":[78],"smaller":[80],"than":[81],"All":[83],"previous":[84],"pseudopolynomial":[85],"algorithms":[86],"actually":[87,94],"solve":[88],"stronger":[90],"task,":[91],"since":[92],"they":[93],"compute":[95],"whole":[97],"S(X,t).":[99]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}