{"id":"https://openalex.org/W2811354873","doi":"https://doi.org/10.1145/3397472","title":"The Complexity of Approximately Counting Retractions","display_name":"The Complexity of Approximately Counting Retractions","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W2811354873","doi":"https://doi.org/10.1145/3397472","mag":"2811354873"},"language":"en","primary_location":{"id":"doi:10.1145/3397472","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3397472","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1807.00590","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jacob Focke","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jacob Focke","raw_affiliation_strings":["University of Oxford, Wolfson Building, Parks Road, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Wolfson Building, Parks Road, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Leslie Ann Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Leslie Ann Goldberg","raw_affiliation_strings":["University of Oxford, Wolfson Building, Parks Road, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Wolfson Building, Parks Road, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":null,"display_name":"Stanislav \u017divn\u00fd","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stanislav \u017divn\u00fd","raw_affiliation_strings":["University of Oxford, Wolfson Building, Parks Road, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Wolfson Building, Parks Road, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.526,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50263505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"12","issue":"3","first_page":"1","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.38089999556541443,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.38089999556541443,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.24779999256134033,"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.20309999585151672,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.7479000091552734},{"id":"https://openalex.org/keywords/trichotomy","display_name":"Trichotomy (philosophy)","score":0.5597000122070312},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5315999984741211},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.5304999947547913},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4072999954223633},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.391400009393692},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.31369999051094055}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8087000250816345},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.7479000091552734},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7451000213623047},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5648999810218811},{"id":"https://openalex.org/C2780233049","wikidata":"https://www.wikidata.org/wiki/Q13134154","display_name":"Trichotomy (philosophy)","level":2,"score":0.5597000122070312},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5315999984741211},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.5304999947547913},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4072999954223633},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.391400009393692},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31369999051094055},{"id":"https://openalex.org/C33222762","wikidata":"https://www.wikidata.org/wiki/Q321119","display_name":"Identity function","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.304500013589859},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.2980000078678131},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3397472","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3397472","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:arXiv.org:1807.00590","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1807.00590","pdf_url":"https://arxiv.org/pdf/1807.00590","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1807.00590","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1807.00590","pdf_url":"https://arxiv.org/pdf/1807.00590","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2824819309","display_name":"Mapping the Complexity of Counting","funder_award_id":"334828","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G8430430141","display_name":"Power of Algorithms in Discrete Optimisation","funder_award_id":"714532","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G8977314523","display_name":"DTP - University of Oxford","funder_award_id":"EP/M508111/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W315200476","https://openalex.org/W655258421","https://openalex.org/W1792041855","https://openalex.org/W1824395173","https://openalex.org/W1964923287","https://openalex.org/W1966994937","https://openalex.org/W1977104034","https://openalex.org/W1982336851","https://openalex.org/W1998601876","https://openalex.org/W2015196367","https://openalex.org/W2019992365","https://openalex.org/W2023673835","https://openalex.org/W2028535821","https://openalex.org/W2033470072","https://openalex.org/W2033649868","https://openalex.org/W2045544549","https://openalex.org/W2051028069","https://openalex.org/W2051283034","https://openalex.org/W2056827961","https://openalex.org/W2077437403","https://openalex.org/W2077575555","https://openalex.org/W2094346430","https://openalex.org/W2106097003","https://openalex.org/W2131747656","https://openalex.org/W2132911512","https://openalex.org/W2156678756","https://openalex.org/W2159793005","https://openalex.org/W2177243619","https://openalex.org/W2199961663","https://openalex.org/W2326367315","https://openalex.org/W2786954219","https://openalex.org/W2962785950","https://openalex.org/W2962998907","https://openalex.org/W2963768895","https://openalex.org/W2963938859","https://openalex.org/W3139132595","https://openalex.org/W4249717465"],"related_works":[],"abstract_inverted_index":{"Let":[0],"G":[1,15,22,54,86],"be":[2],"a":[3,19,48,110,132,150,152,172,192,231],"graph":[4,53,133],"that":[5,25,63,196,272,311],"contains":[6],"an":[7,51,157,168],"induced":[8],"subgraph":[9],"H":[10,17,24,31,39,56,69,88,134,148,182,221,246],".":[11,32,208],"A":[12],"retraction":[13,49,241],"from":[14,21,50,85,282,290],"to":[16,23,55,87,108,117,131,181,185,220,224,238,262,321],"is":[18,26,47,57,65,72,89,98,107,124,140,149,167,183,197,222,237,279,316,340],"homomorphism":[20],"the":[27,41,61,79,188,200,227,240,248,263,266,273,283,291,312,325,331,341],"identity":[28],"function":[29],"on":[30],"Retractions":[33],"are":[34,259,306],"very":[35],"well":[36],"studied:":[37],"Given":[38],",":[40],"complexity":[42,80,203,249],"of":[43,81,135,147,191,213,230,251,275,285,293,303,314,327,333,343,345],"deciding":[44],"whether":[45],"there":[46],"input":[52],"completely":[58],"classified,":[59],"in":[60,141,199,247,260,265],"sense":[62],"it":[64],"known":[66,99],"for":[67,113,244,298],"which":[68],"this":[70],"problem":[71,195,243,274,284,292],"tractable":[73],"(assuming":[74,91],"P":[75],"\u2260":[76,93],"NP).":[77],"Similarly,":[78],"(exactly)":[82],"counting":[83,102,115,129,179,187,202,218,226,242,254,268,277,287,295,300,338,348],"retractions":[84,116,130,180,219,278,315],"classified":[90],"FP":[92,142],"#P).":[94],"However,":[95],"almost":[96],"nothing":[97],"about":[100],"approximately":[101,114,178,186,217,225,276,286,294],"retractions.":[103],"Our":[104,234],"first":[105],"contribution":[106,236],"give":[109],"complete":[111,198],"trichotomy":[112],"graphs":[118],"without":[119],"short":[120],"cycles.":[121],"The":[122],"result":[123],"as":[125,319,323],"follows:":[126],"(1)":[127],"Approximately":[128],"girth":[136],"at":[137,317],"least":[138,318],"5":[139],"if":[143,164,211],"every":[144,165],"connected":[145],"component":[146,166],"star,":[151],"single":[153],"looped":[154],"vertex,":[155],"or":[156,171],"edge":[158],"with":[159],"two":[160],"loops.":[161],"(2)":[162],"Otherwise,":[163],"irreflexive":[169],"caterpillar":[170],"partially":[173],"bristled":[174],"reflexive":[175],"path,":[176],"then":[177,216],"equivalent":[184,223],"independent":[189],"sets":[190],"bipartite":[193],"graph\u2014a":[194],"approximate":[201,253,322],"class":[204],"RH":[205],"\u03a0":[206],"1":[207],"(3)":[209],"Finally,":[210],"none":[212],"these":[214,304,346],"hold,":[215],"satisfying":[228],"assignments":[229],"Boolean":[232],"formula.":[233],"second":[235],"locate":[239],"each":[245],"landscape":[250],"related":[252],"problems.":[255,349],"Interestingly,":[256],"our":[257],"results":[258],"contrast":[261],"situation":[264],"exact":[267,299,347],"context.":[269],"We":[270,308],"show":[271,310],"separated":[280],"both":[281,324],"homomorphisms":[288,329],"and":[289,330],"list":[296],"homomorphisms\u2014whereas":[297],"all":[301,344],"three":[302],"problems":[305],"interreducible.":[307],"also":[309],"number":[313,326,332],"hard":[320],"surjective":[328],"compactions.":[334],"In":[335],"contrast,":[336],"exactly":[337],"compactions":[339],"hardest":[342]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2018-07-10T00:00:00"}