{"id":"https://openalex.org/W2963938859","doi":"https://doi.org/10.1145/3037381","title":"A Complexity Trichotomy for Approximately Counting List <i>H</i> -Colorings","display_name":"A Complexity Trichotomy for Approximately Counting List <i>H</i> -Colorings","publication_year":2017,"publication_date":"2017-04-27","ids":{"openalex":"https://openalex.org/W2963938859","doi":"https://doi.org/10.1145/3037381","mag":"2963938859"},"language":"en","primary_location":{"id":"doi:10.1145/3037381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3037381","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/A5089713528","display_name":"Andreas Galanis","orcid":"https://orcid.org/0000-0003-3579-6531"},"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":"Andreas Galanis","raw_affiliation_strings":["University of Oxford, Parks Road, Oxford"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Parks Road, Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029293569","display_name":"Leslie Ann Goldberg","orcid":"https://orcid.org/0000-0003-1879-6089"},"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, Parks Road, Oxford"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Parks Road, Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090122841","display_name":"Mark Jerrum","orcid":"https://orcid.org/0000-0003-0863-7279"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark Jerrum","raw_affiliation_strings":["Queen Mary, University of London, Mile End Road, London"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queen Mary, University of London, Mile End Road, London","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3749,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8402173,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"2","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9988999962806702,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9980000257492065,"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/trichotomy","display_name":"Trichotomy (philosophy)","score":0.8199690580368042},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7711465954780579},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.685566782951355},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6288827657699585},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6037889719009399},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.6004814505577087},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4473596215248108},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.43774721026420593},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4316129684448242},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38026684522628784}],"concepts":[{"id":"https://openalex.org/C2780233049","wikidata":"https://www.wikidata.org/wiki/Q13134154","display_name":"Trichotomy (philosophy)","level":2,"score":0.8199690580368042},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7711465954780579},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.685566782951355},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6288827657699585},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6037889719009399},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.6004814505577087},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4473596215248108},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.43774721026420593},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4316129684448242},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38026684522628784},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3037381","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3037381","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:qmro.qmul.ac.uk:123456789/22421","is_oa":false,"landing_page_url":"http://qmro.qmul.ac.uk/xmlui/handle/123456789/22421","pdf_url":null,"source":{"id":"https://openalex.org/S4306400530","display_name":"Queen Mary Research Online (Queen Mary University of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I166337079","host_organization_name":"Queen Mary University of London","host_organization_lineage":["https://openalex.org/I166337079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1197539974","display_name":null,"funder_award_id":"EP/N004221/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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1770469170","https://openalex.org/W1776308369","https://openalex.org/W1792041855","https://openalex.org/W1799220988","https://openalex.org/W1839720158","https://openalex.org/W1937281308","https://openalex.org/W1989591709","https://openalex.org/W2000763343","https://openalex.org/W2004724832","https://openalex.org/W2018547288","https://openalex.org/W2024710200","https://openalex.org/W2033470072","https://openalex.org/W2040145343","https://openalex.org/W2042816208","https://openalex.org/W2057512592","https://openalex.org/W2061042466","https://openalex.org/W2083102899","https://openalex.org/W2132911512","https://openalex.org/W2177243619","https://openalex.org/W2736166735","https://openalex.org/W2950321316","https://openalex.org/W2950754995","https://openalex.org/W2963795759","https://openalex.org/W3101482641","https://openalex.org/W3125284116","https://openalex.org/W4247305611","https://openalex.org/W4255798272"],"related_works":["https://openalex.org/W2952991316","https://openalex.org/W2405987656","https://openalex.org/W782850337","https://openalex.org/W2893188841","https://openalex.org/W2158949528","https://openalex.org/W4291316631","https://openalex.org/W2963938859","https://openalex.org/W2065888137","https://openalex.org/W2573875671","https://openalex.org/W2951667105"],"abstract_inverted_index":{"We":[0,15,195],"examine":[1],"the":[2,8,23,26,77,119,159,176,192,200,204],"computational":[3],"complexity":[4],"of":[5,12,25,79,98,158,170],"approximately":[6,68,80,132],"counting":[7,43,69,81,122,133],"list":[9,44,70,134],"H":[10,28,31,45,54,71,130,135],"-colorings":[11,46,72,136],"a":[13,17,38,62,85,90,165],"graph.":[14,87],"discover":[16],"natural":[18,166],"graph-theoretic":[19],"trichotomy":[20,160],"based":[21],"on":[22],"structure":[24],"graph":[27,36,60,129,172],".":[29],"If":[30],"is":[32,47,55,73,89,94,101,113,137,148,178],"an":[33,56,108],"irreflexive":[34,57],"bipartite":[35,58,86],"or":[37,61],"reflexive":[39,63],"complete":[40,138],"graph,":[41,66],"then":[42,67],"trivially":[48],"in":[49,84,124,168,191],"polynomial":[50],"time.":[51],"Otherwise,":[52],"if":[53],"permutation":[59],"proper":[64],"interval":[65],"equivalent":[74],"to":[75,96,143,198,203,213],"#BIS,":[76],"problem":[78,92],"independent":[82],"sets":[83],"This":[88],"well-studied":[91],"that":[93,103,111,208],"believed":[95,102],"be":[97],"intermediate":[99],"complexity\u2014it":[100],"it":[104,112,163],"does":[105,182],"not":[106,114,183],"have":[107],"FPRAS,":[109],"but":[110],"as":[115,117],"difficult":[116,121],"approximating":[118],"most":[120,220],"problems":[123],"#P.":[125],"For":[126],"every":[127],"other":[128],",":[131],"for":[139],"#P":[140],"with":[141,216],"respect":[142],"approximation-preserving":[144],"reductions":[145],"(so":[146],"there":[147],"no":[149],"FPRAS":[150],"unless":[151],"NP":[152],"=":[153],"RP).":[154],"Two":[155],"pleasing":[156],"features":[157],"are":[161,196],"(1)":[162],"has":[164],"formulation":[167],"terms":[169],"hereditary":[171],"classes,":[173],"and":[174,181],"(2)":[175],"proof":[177],"largely":[179],"self-contained":[180],"require":[184],"any":[185],"universal":[186],"algebra":[187],"(unlike":[188],"similar":[189],"dichotomies":[190],"weighted":[193],"case).":[194],"able":[197],"extend":[199],"hardness":[201,210],"results":[202,211],"bounded-degree":[205],"setting,":[206],"showing":[207],"all":[209],"apply":[212],"input":[214],"graphs":[215],"maximum":[217],"degree":[218],"at":[219],"6.":[221]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2019-07-30T00:00:00"}