{"id":"https://openalex.org/W3131687093","doi":"https://doi.org/10.1145/3442352","title":"Fine-Grained Reductions from Approximate Counting to Decision","display_name":"Fine-Grained Reductions from Approximate Counting to Decision","publication_year":2021,"publication_date":"2021-02-10","ids":{"openalex":"https://openalex.org/W3131687093","doi":"https://doi.org/10.1145/3442352","mag":"3131687093"},"language":"en","primary_location":{"id":"doi:10.1145/3442352","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3442352","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","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/A5052689442","display_name":"Holger Dell","orcid":"https://orcid.org/0000-0001-8955-0786"},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]},{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DE","DK"],"is_corresponding":true,"raw_author_name":"Holger Dell","raw_affiliation_strings":["Goethe University Frankfurt, Germany and IT University of Copenhagen, Denmark and Basic Algorithms Research Copenhagen (BARC), Denmark"],"affiliations":[{"raw_affiliation_string":"Goethe University Frankfurt, Germany and IT University of Copenhagen, Denmark and Basic Algorithms Research Copenhagen (BARC), Denmark","institution_ids":["https://openalex.org/I83467386","https://openalex.org/I114090438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035827198","display_name":"John Lapinskas","orcid":"https://orcid.org/0000-0003-3197-0854"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"John Lapinskas","raw_affiliation_strings":["University of Bristol, Bristol, UK"],"affiliations":[{"raw_affiliation_string":"University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052689442"],"corresponding_institution_ids":["https://openalex.org/I114090438","https://openalex.org/I83467386"],"apc_list":null,"apc_paid":null,"fwci":0.8878,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76915384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"2","first_page":"1","last_page":"24"},"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.9998999834060669,"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.9998999834060669,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.7054083943367004},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5837169885635376},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5759185552597046},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5498412847518921},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5416801571846008},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5373353958129883},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5131645798683167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46960553526878357},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4586624205112457},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.45095789432525635},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.44000017642974854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27208179235458374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2250034213066101}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7054083943367004},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5837169885635376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5759185552597046},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5498412847518921},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5416801571846008},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5373353958129883},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5131645798683167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46960553526878357},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4586624205112457},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.45095789432525635},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.44000017642974854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27208179235458374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2250034213066101},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3442352","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3442352","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/2f308edc-1bf7-4546-9917-3ad656594f47","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/2f308edc-1bf7-4546-9917-3ad656594f47","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Dell, H & Lapinskas, J 2021, 'Fine-Grained Reductions from Approximate Counting to Decision', ACM Transactions on Computation Theory, vol. 13, no. 2, 8, pp. 1-24. https://doi.org/10.1145/3442352","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1514496467","https://openalex.org/W1570607879","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2006912660","https://openalex.org/W2014603110","https://openalex.org/W2031683606","https://openalex.org/W2042764910","https://openalex.org/W2049136377","https://openalex.org/W2049647076","https://openalex.org/W2057512592","https://openalex.org/W2064790310","https://openalex.org/W2084732238","https://openalex.org/W2091301672","https://openalex.org/W2092928619","https://openalex.org/W2098207812","https://openalex.org/W2131798840","https://openalex.org/W2137407595","https://openalex.org/W2161611531","https://openalex.org/W2177243619","https://openalex.org/W2180459618","https://openalex.org/W2206830592","https://openalex.org/W2243432867","https://openalex.org/W2256089709","https://openalex.org/W2478722229","https://openalex.org/W2782707694","https://openalex.org/W2884951099","https://openalex.org/W2892948282","https://openalex.org/W2964266546","https://openalex.org/W2989661724","https://openalex.org/W4213071546","https://openalex.org/W4242600797","https://openalex.org/W4255005259","https://openalex.org/W4389615669","https://openalex.org/W6947591345"],"related_works":["https://openalex.org/W4390575969","https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2113270940","https://openalex.org/W1886770168","https://openalex.org/W2900627138","https://openalex.org/W4390579151"],"abstract_inverted_index":{"In":[0,310],"this":[1],"article,":[2],"we":[3,20,72,226,286],"introduce":[4],"a":[5,42,58,214,244,338],"general":[6,172],"framework":[7,169],"for":[8,76,158,181,199,263,282,289,305],"fine-grained":[9,84,245],"reductions":[10,75,123],"of":[11,35,45,61,78,178,216,232,340,357],"approximate":[12,32,248,306,334],"counting":[13],"problems":[14,82,107,180],"to":[15,30,100,143,164,174,176,250,323,333,336],"their":[16],"decision":[17],"versions.":[18],"(Thus,":[19],"use":[21],"an":[22,275,295],"oracle":[23],"that":[24,116,225,262,288,315,328],"decides":[25],"whether":[26],"any":[27],"witness":[28],"exists":[29],"multiplicatively":[31],"the":[33,54,66,79,86,92,148,159,179,190,230,237,253,316,324,358],"number":[34,231],"witnesses":[36],"with":[37,235],"minimal":[38],"overhead.)":[39],"This":[40],"mirrors":[41],"foundational":[43],"result":[44,60,215,223,313],"Sipser":[46],"(STOC":[47,166],"1983)":[48],"and":[49,57,91,138,218,270],"Stockmeyer":[50],"(SICOMP":[51],"1985)":[52],"in":[53,65,83,205,342],"polynomial-time":[55],"setting,":[56],"similar":[59],"M\u00fcller":[62],"(IWPEC":[63],"2006)":[64],"FPT":[67],"setting.":[68],"Using":[69],"our":[70,122,222,312],"framework,":[71],"obtain":[73],"such":[74,146],"some":[77,264],"most":[80],"important":[81],"complexity:":[85],"Orthogonal":[87,191],"Vectors":[88,192],"problem,":[89],"3SUM,":[90],"Negative-Weight":[93,160],"Triangle":[94,161],"problem":[95,162,193],"(which":[96],"is":[97,114,120,170,259,274,294,321,330],"closely":[98],"related":[99],"All-Pairs":[101],"Shortest":[102],"Path).":[103],"While":[104],"all":[105,271,290],"these":[106,129],"have":[108,134],"simple":[109],"algorithms":[110,185],"over":[111,194],"which":[112,182],"it":[113],"conjectured":[115],"no":[117,331],"polynomial":[118],"improvement":[119],"possible,":[121],"would":[124],"remain":[125],"interesting":[126],"even":[127],"if":[128],"conjectures":[130],"were":[131],"proved;":[132],"they":[133],"only":[135],"polylogarithmic":[136],"overhead":[137],"can":[139,202,227],"therefore":[140],"be":[141,203],"applied":[142],"subpolynomial":[144],"improvements":[145],"as":[147,355],"n":[149,155,207,279,302,347],"3":[150],"/":[151],"exp(\u0398":[152],"(\u221a":[153],"log":[154],"))-time":[156],"algorithm":[157,281,304,332],"due":[163],"Williams":[165,217],"2014).":[167],"Our":[168],"also":[171,242],"enough":[173],"apply":[175],"versions":[177],"more":[183],"efficient":[184],"are":[186],"known.":[187],"For":[188],"example,":[189],"GF(":[195],"m":[196,201],")":[197,212],"d":[198,211],"constant":[200],"solved":[204],"time":[206,343],"\u00b7":[208],"poly":[209],"(":[210,277,346],"by":[213],"Yu":[219],"(SODA":[220],"2014);":[221],"implies":[224,314],"approximately":[228],"count":[229],"orthogonal":[233],"pairs":[234],"essentially":[236],"same":[238],"running":[239],"time.":[240],"We":[241],"provide":[243],"reduction":[246],"from":[247],"#SAT":[249],"SAT.":[251],"Suppose":[252],"Strong":[254],"Exponential":[255,317],"Time":[256,318],"Hypothesis":[257,319],"(SETH)":[258],"false,":[260],"so":[261],"1":[265],"<":[266,268],"c":[267,278,298],"2":[269,344,350],"k":[272,283,291,308],"there":[273,293,329],"O":[276,296],")-time":[280,303],"-SAT.":[284,309],"Then":[285],"prove":[287],",":[292],"((":[297],"+":[299],"o":[300,345],"(1))":[301],"#":[307],"particular,":[311],"(ETH)":[320],"equivalent":[322],"seemingly":[325],"weaker":[326],"statement":[327],"#3-SAT":[335],"within":[337],"factor":[339],"1+\u025b":[341],")/":[348],"\u025b":[349,352],"(taking":[351],">":[353],"0":[354],"part":[356],"input).":[359]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}