{"id":"https://openalex.org/W4390986120","doi":"https://doi.org/10.1007/s00037-023-00247-8","title":"Approximating the chromatic polynomial is as hard as computing it exactly","display_name":"Approximating the chromatic polynomial is as hard as computing it exactly","publication_year":2024,"publication_date":"2024-01-18","ids":{"openalex":"https://openalex.org/W4390986120","doi":"https://doi.org/10.1007/s00037-023-00247-8"},"language":"lv","primary_location":{"id":"doi:10.1007/s00037-023-00247-8","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00037-023-00247-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-023-00247-8.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-023-00247-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078997533","display_name":"Ferenc Bencs","orcid":null},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ferenc Bencs","raw_affiliation_strings":["Korteweg de Vries Institute for Mathematics, University of Amsterdam, P.O. Box 94248, 1090, GE, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korteweg de Vries Institute for Mathematics, University of Amsterdam, P.O. Box 94248, 1090, GE, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043503707","display_name":"J. Huijben","orcid":null},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jeroen Huijben","raw_affiliation_strings":["Korteweg de Vries Institute for Mathematics, University of Amsterdam, P.O. Box 94248, 1090, GE, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korteweg de Vries Institute for Mathematics, University of Amsterdam, P.O. Box 94248, 1090, GE, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072303140","display_name":"Guus Regts","orcid":"https://orcid.org/0000-0002-7813-4952"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Guus Regts","raw_affiliation_strings":["Korteweg de Vries Institute for Mathematics, University of Amsterdam, P.O. Box 94248, 1090, GE, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korteweg de Vries Institute for Mathematics, University of Amsterdam, P.O. Box 94248, 1090, GE, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072303140"],"corresponding_institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.319,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54578697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"33","issue":"1","first_page":null,"last_page":null},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994999766349792,"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/algorithm","display_name":"Algorithm","score":0.5849099159240723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2903037369251251}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5849099159240723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2903037369251251}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00037-023-00247-8","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00037-023-00247-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-023-00247-8.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/dc758095-9355-4dc6-ac72-f7d0d7d143c0","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/approximating-the-chromatic-polynomial-is-as-hard-as-computing-it-exactly(dc758095-9355-4dc6-ac72-f7d0d7d143c0).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bencs, F, Huijben, J & Regts, G 2024, 'Approximating the chromatic polynomial is as hard as computing it exactly', Computational Complexity, vol. 33, no. 1, 1. https://doi.org/10.1007/s00037-023-00247-8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:cwi.nl:34922","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/34922","pdf_url":"https://ir.cwi.nl/pub/34922/34922.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computational Complexity vol. 33, pp. 1:1-1:47","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dare.uva.nl:openaire/dc758095-9355-4dc6-ac72-f7d0d7d143c0","is_oa":true,"landing_page_url":"https://hdl.handle.net/11245.1/dc758095-9355-4dc6-ac72-f7d0d7d143c0","pdf_url":"https://pure.uva.nl/ws/files/228009675/Approximating_the_chromatic_polynomial_is_as_hard_as_computing_it_exactly.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bencs, F, Huijben, J & Regts, G 2024, 'Approximating the chromatic polynomial is as hard as computing it exactly', Computational Complexity, vol. 33, no. 1, 1. https://doi.org/10.1007/s00037-023-00247-8","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00037-023-00247-8","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00037-023-00247-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-023-00247-8.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7999705830","display_name":null,"funder_award_id":"VI.Vidi.193.068","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4390986120.pdf"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W1531965102","https://openalex.org/W1803292696","https://openalex.org/W1971967210","https://openalex.org/W2011473996","https://openalex.org/W2024560865","https://openalex.org/W2037114932","https://openalex.org/W2039763834","https://openalex.org/W2044116850","https://openalex.org/W2072467734","https://openalex.org/W2072572225","https://openalex.org/W2086798396","https://openalex.org/W2107791854","https://openalex.org/W2112310806","https://openalex.org/W2116974373","https://openalex.org/W2122765404","https://openalex.org/W2130504407","https://openalex.org/W2141040012","https://openalex.org/W2145020318","https://openalex.org/W2158782826","https://openalex.org/W2295121732","https://openalex.org/W2474151873","https://openalex.org/W2607730504","https://openalex.org/W2801659200","https://openalex.org/W2805560841","https://openalex.org/W2895543709","https://openalex.org/W2963400600","https://openalex.org/W2963721130","https://openalex.org/W3021148778","https://openalex.org/W3037009920","https://openalex.org/W3083243048","https://openalex.org/W3088330630","https://openalex.org/W3099348984","https://openalex.org/W3100613059","https://openalex.org/W3103520888","https://openalex.org/W3105058115","https://openalex.org/W3159031254","https://openalex.org/W4206186706","https://openalex.org/W4255275348","https://openalex.org/W4256131629","https://openalex.org/W4280569971","https://openalex.org/W4298377312","https://openalex.org/W4384342743"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2544423928","https://openalex.org/W2052122378","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W4313731559"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"show":[2],"that":[3,12,94,117],"for":[4,73,90,122,145],"any":[5],"non-real":[6,75,133],"algebraic":[7,76,134],"number":[8],"q":[9,66,77,91,135],",":[10,92],"such":[11,93],"$$|q-1|&gt;1$$":[13],"<mml:math":[14,28,97],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[15,29,98],"<mml:mrow>":[16,30,32,99],"<mml:mo>|</mml:mo>":[17,21,100,104],"<mml:mi>q</mml:mi>":[18,34,101],"<mml:mo>-</mml:mo>":[19,102],"<mml:mn>1</mml:mn>":[20,23,103,106],"<mml:mo>&gt;</mml:mo>":[22,37],"</mml:mrow>":[24,36,42,107],"</mml:math>":[25,43,108],"or":[26],"$$\\Re(q)&gt;\\frac{3}{2}$$":[27],"<mml:mi>\u211c</mml:mi>":[31],"<mml:mo>(</mml:mo>":[33],"<mml:mo>)</mml:mo>":[35],"<mml:mfrac>":[38],"<mml:mn>3</mml:mn>":[39],"<mml:mn>2</mml:mn>":[40],"</mml:mfrac>":[41],"it":[44],"is":[45,150],"#P-hard":[46],"to":[47,54,140,152,167],"compute":[48],"a":[49,118,129,141,156,178],"multiplicative":[50],"(resp.":[51,58],"additive)":[52],"approximation":[53],"the":[55,61,79,125,168,174,182],"absolute":[56],"value":[57],"argument)":[59],"of":[60,81,128,158,161,173,181],"chromatic":[62,126],"polynomial":[63,119,127,142],"evaluated":[64],"at":[65,132],"on":[67,78],"planar":[68,130],"graphs.":[69,83],"This":[70],"implies":[71],"#P-hardness":[72],"all":[74,82],"family":[80],"We,":[84],"moreover,":[85],"prove":[86],"several":[87],"hardness":[88,111],"results":[89,112,163],"$$|q-1|\\leq":[95],"1$$":[96],"<mml:mo>\u2264</mml:mo>":[105],".":[109],"Our":[110],"are":[113],"obtained":[114],"by":[115,155],"showing":[116],"time":[120,143],"algorithm":[121,144],"approximately":[123],"computing":[124,147],"graph":[131],"(satisfying":[136],"some":[137],"properties)":[138],"leads":[139],"exactly":[146],"it,":[148],"which":[149],"known":[151],"be":[153],"hard":[154],"result":[157],"Vertigan.":[159],"Many":[160],"our":[162],"extend":[164],"in":[165],"fact":[166],"more":[169],"general":[170],"partition":[171],"function":[172],"random":[175],"cluster":[176],"model,":[177],"well-known":[179],"reparametrization":[180],"Tutte":[183],"polynomial.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}