{"id":"https://openalex.org/W3170248899","doi":"https://doi.org/10.1145/3519935.3520075","title":"Complexity classification of counting graph homomorphisms modulo a prime number","display_name":"Complexity classification of counting graph homomorphisms modulo a prime number","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W3170248899","doi":"https://doi.org/10.1145/3519935.3520075","mag":"3170248899"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520075","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","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/A5103266587","display_name":"Andre\u01d0 A. Bulatov","orcid":"https://orcid.org/0000-0002-5516-1704"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Andrei A. Bulatov","raw_affiliation_strings":["Simon Fraser University, Canada"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054796209","display_name":"Amirhossein Kazeminia","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Amirhossein Kazeminia","raw_affiliation_strings":["Simon Fraser University, Canada"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103266587"],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":0.26334776,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.43291444,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1024","last_page":"1037"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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.9975000023841858,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/homomorphism","display_name":"Homomorphism","score":0.8615529537200928},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7710703611373901},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6436163187026978},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.559653639793396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5534915924072266},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.5291200876235962},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5287363529205322},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5151439905166626},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.46316206455230713},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.43531161546707153},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41802743077278137},{"id":"https://openalex.org/keywords/prime-number","display_name":"Prime number","score":0.4171625077724457},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3260740041732788},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16422304511070251},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.16182652115821838},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06581494212150574}],"concepts":[{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.8615529537200928},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7710703611373901},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6436163187026978},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.559653639793396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5534915924072266},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.5291200876235962},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5287363529205322},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5151439905166626},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.46316206455230713},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.43531161546707153},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41802743077278137},{"id":"https://openalex.org/C113429393","wikidata":"https://www.wikidata.org/wiki/Q49008","display_name":"Prime number","level":2,"score":0.4171625077724457},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3260740041732788},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16422304511070251},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.16182652115821838},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06581494212150574},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3520075","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1552293753","https://openalex.org/W1565722675","https://openalex.org/W1576457731","https://openalex.org/W1638461282","https://openalex.org/W1936195772","https://openalex.org/W1980467407","https://openalex.org/W1991486497","https://openalex.org/W2006912660","https://openalex.org/W2024710200","https://openalex.org/W2025319967","https://openalex.org/W2026753685","https://openalex.org/W2030999876","https://openalex.org/W2040145343","https://openalex.org/W2049559029","https://openalex.org/W2051378572","https://openalex.org/W2078752178","https://openalex.org/W2091345559","https://openalex.org/W2115826669","https://openalex.org/W2118223706","https://openalex.org/W2131358503","https://openalex.org/W2145707075","https://openalex.org/W2150339067","https://openalex.org/W2490805901","https://openalex.org/W2594596354","https://openalex.org/W2963436238","https://openalex.org/W2970099334","https://openalex.org/W3115632466","https://openalex.org/W3121710873","https://openalex.org/W3130122773","https://openalex.org/W3139555203","https://openalex.org/W4210896998","https://openalex.org/W4302574963"],"related_works":["https://openalex.org/W4375869854","https://openalex.org/W2782277909","https://openalex.org/W1548348759","https://openalex.org/W2126491855","https://openalex.org/W1990755119","https://openalex.org/W2951237623","https://openalex.org/W2148608710","https://openalex.org/W4321649496","https://openalex.org/W2053242449","https://openalex.org/W4253538798"],"abstract_inverted_index":{"Counting":[0,9],"graph":[1,38,86,145],"homomorphisms":[2,39,82],"and":[3,16,41,44,50,52,74,134],"its":[4,14],"generalizations":[5],"such":[6],"as":[7,67],"the":[8,26,32,45,126,137],"Constraint":[10],"Satisfaction":[11],"Problem":[12],"(CSP),":[13],"variations,":[15],"counting":[17,36,46,58,81,133],"problems":[18],"in":[19],"general":[20,138],"have":[21],"been":[22],"intensively":[23],"studied":[24],"since":[25],"pioneering":[27],"work":[28],"of":[29,34,37,105,118,128],"Valiant.":[30],"While":[31],"complexity":[33],"exact":[35],"(Dyer":[40],"Greenhill,":[42],"2000)":[43],"CSP":[47,139],"(Bulatov,":[48],"2013,":[49],"Dyer":[51],"Richerby,":[53],"2013)":[54],"is":[55,92,96],"well":[56],"understood,":[57],"modulo":[59,88],"some":[60],"natural":[61],"number":[62,91],"has":[63,103],"attracted":[64],"considerable":[65],"interest":[66],"well.":[68],"In":[69,108],"their":[70],"2015":[71],"paper":[72,110],"Faben":[73],"Jerrum":[75],"suggested":[76],"a":[77,84,89,116],"conjecture":[78],"stating":[79],"that":[80,124],"to":[83,98,136,144],"fixed":[85],"H":[87,102],"prime":[90],"hard":[93,97],"whenever":[94],"it":[95],"count":[99],"exactly,":[100],"unless":[101],"automorphisms":[104],"certain":[106],"kind.":[107],"this":[109,113,119],"we":[111,121],"confirm":[112],"conjecture.":[114],"As":[115],"part":[117],"investigation":[120],"develop":[122],"techniques":[123],"widen":[125],"spectrum":[127],"reductions":[129],"available":[130],"for":[131],"modular":[132],"apply":[135],"rather":[140],"than":[141],"being":[142],"limited":[143],"homomorphisms.":[146]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}