{"id":"https://openalex.org/W2593213569","doi":"https://doi.org/10.1145/3293465","title":"On Problems Equivalent to (min,+)-Convolution","display_name":"On Problems Equivalent to (min,+)-Convolution","publication_year":2019,"publication_date":"2019-01-08","ids":{"openalex":"https://openalex.org/W2593213569","doi":"https://doi.org/10.1145/3293465","mag":"2593213569"},"language":"en","primary_location":{"id":"doi:10.1145/3293465","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3293465","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":null,"display_name":"Marek Cygan","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Marcin Mucha","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marcin Mucha","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Karol W\u0119grzycki","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Karol W\u0119grzycki","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":null,"display_name":"Micha\u0142 W\u0142odarczyk","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 W\u0142odarczyk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":1.5964,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.84481859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"1","first_page":"1","last_page":"25"},"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.6384999752044678,"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.6384999752044678,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.12099999934434891,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.04399999976158142,"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/subadditivity","display_name":"Subadditivity","score":0.6643000245094299},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5924999713897705},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.567300021648407},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5498999953269958},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.525600016117096},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.40549999475479126},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.3785000145435333},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.36880001425743103}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7537000179290771},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.6643000245094299},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5924999713897705},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.567300021648407},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5498999953269958},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.525600016117096},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.40549999475479126},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.3785000145435333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3743000030517578},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37139999866485596},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.35910001397132874},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33469998836517334},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3296999931335449},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.32339999079704285},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.29100000858306885},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.27469998598098755},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.260699987411499}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3293465","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3293465","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1607456165","https://openalex.org/W1764956874","https://openalex.org/W1968531819","https://openalex.org/W1984863471","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W1996791172","https://openalex.org/W2009234246","https://openalex.org/W2018804864","https://openalex.org/W2028341270","https://openalex.org/W2031683606","https://openalex.org/W2045492613","https://openalex.org/W2055693471","https://openalex.org/W2064790310","https://openalex.org/W2067176532","https://openalex.org/W2084732238","https://openalex.org/W2084803275","https://openalex.org/W2091505308","https://openalex.org/W2092717367","https://openalex.org/W2098207812","https://openalex.org/W2100020153","https://openalex.org/W2104947808","https://openalex.org/W2139087151","https://openalex.org/W2207058206","https://openalex.org/W2294619171","https://openalex.org/W2296148711","https://openalex.org/W2407163532","https://openalex.org/W2537252502","https://openalex.org/W2569902587","https://openalex.org/W2800485060","https://openalex.org/W2963906549","https://openalex.org/W3018894705","https://openalex.org/W4206648722","https://openalex.org/W4213071546","https://openalex.org/W4238862570","https://openalex.org/W6801233240"],"related_works":[],"abstract_inverted_index":{"In":[0,56,141],"recent":[1],"years,":[2],"significant":[3],"progress":[4,26],"has":[5,27,189,206],"been":[6,190],"made":[7],"in":[8,29,121,196,203],"explaining":[9],"the":[10,16,30,57,61,150,161,175,237],"apparent":[11],"hardness":[12,156,213],"of":[13,32,149,163,169,174,219],"improving":[14],"upon":[15],"naive":[17],"solutions":[18],"for":[19,137,198,246],"many":[20,199],"fundamental":[21],"polynomially":[22],"solvable":[23],"problems.":[24,248],"This":[25,116],"come":[28],"form":[31],"conditional":[33],"lower":[34],"bounds\u2014reductions":[35],"from":[36],"a":[37,66,87,101,146,155,167,193],"problem":[38,153,165,178,188],"assumed":[39],"to":[40,64,166,182],"be":[41,119,244],"hard.":[42],"The":[43,185],"hard":[44],"problems":[45,180,202],"include":[46],"3SUM,":[47],"All-Pairs":[48],"Shortest":[49],"Path,":[50],"SAT,":[51],"Orthogonal":[52],"Vectors,":[53],"and":[54,107,179,222,226],"others.":[55],"(min":[58,151,186],",+)-convolution":[59,152,187],"problem,":[60],"goal":[62],"is":[63,135],"compute":[65],"sequence":[67],"(":[68,100,108,130],"c":[69,77],"[":[70,78,88,93,102,110],"i":[71,89,96,103,111],"])":[72,104,112],"n-1":[73,105,113],"i=0":[74,106,114],",":[75,84],"where":[76],"k":[79,85,94],"]":[80,90],"=":[81],"min":[82],"i=0,\u2026;":[83],"{":[86],"+":[91],"b":[92,109],"-":[95],"]},":[97],"given":[98],"sequences":[99],".":[115],"can":[117],"easily":[118],"done":[120],"O(":[122],"n":[123,131],"2":[124],")":[125,133],"time,":[126],"but":[127],"no":[128],"O":[129],"2-\u03b5":[132],"algorithm":[134],"known":[136],"\u03b5":[138],">":[139],"0.":[140],"this":[142,164,234],"article,":[143],"we":[144,159,216],"undertake":[145],"systematic":[147],"study":[148],"as":[154,192,209],"assumption.":[157,214],"First,":[158],"establish":[160],"equivalence":[162],"group":[168],"other":[170,227],"problems,":[171,200],"including":[172],"variants":[173],"classic":[176],"knapsack":[177],"related":[181],"subadditive":[183],"sequences.":[184],"used":[191],"building":[194],"block":[195],"algorithms":[197],"notably":[201],"stringology.":[204],"It":[205],"also":[207,230],"appeared":[208],"an":[210],"ad":[211],"hoc":[212],"Second,":[215],"investigate":[217],"some":[218,247],"these":[220],"connections":[221],"provide":[223],"new":[224],"reductions":[225],"results.":[228],"We":[229],"explain":[231],"why":[232],"replacing":[233],"assumption":[235],"with":[236],"Strong":[238],"Exponential":[239],"Time":[240],"Hypothesis":[241],"might":[242],"not":[243],"possible":[245]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2017-03-16T00:00:00"}