{"id":"https://openalex.org/W2898776142","doi":"https://doi.org/10.1145/3457606","title":"Algebraic Approach to Promise Constraint Satisfaction","display_name":"Algebraic Approach to Promise Constraint Satisfaction","publication_year":2021,"publication_date":"2021-07-14","ids":{"openalex":"https://openalex.org/W2898776142","doi":"https://doi.org/10.1145/3457606","mag":"2898776142"},"language":"en","primary_location":{"id":"doi:10.1145/3457606","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3457606","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3457606","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3457606","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071004419","display_name":"Libor Barto","orcid":"https://orcid.org/0000-0002-8481-6458"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Libor Barto","raw_affiliation_strings":["Charles University, Prague, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065699864","display_name":"Jakub Bul\u00edn","orcid":"https://orcid.org/0000-0001-5235-8715"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jakub Bul\u00edn","raw_affiliation_strings":["Charles University, Prague, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003558662","display_name":"Andrei Krokhin","orcid":"https://orcid.org/0000-0003-4373-8227"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrei Krokhin","raw_affiliation_strings":["Durham University, Durham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056419307","display_name":"Jakub Opr\u0161al","orcid":"https://orcid.org/0000-0003-1245-3456"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jakub Opr\u0161al","raw_affiliation_strings":["Durham University, Durham, UK"],"raw_orcid":"https://orcid.org/0000-0003-1245-3456","affiliations":[{"raw_affiliation_string":"Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":{"value":1780,"currency":"EUR","value_usd":1919},"fwci":6.611,"has_fulltext":true,"cited_by_count":77,"citation_normalized_percentile":{"value":0.97281898,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"68","issue":"4","first_page":"1","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.654000997543335},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.6374538540840149},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6114449501037598},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.5198574662208557},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4999220371246338},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4404638707637787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4395027756690979},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.384549617767334},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18123376369476318},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.14180424809455872},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06153082847595215}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.654000997543335},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.6374538540840149},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6114449501037598},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.5198574662208557},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4999220371246338},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4404638707637787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4395027756690979},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.384549617767334},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18123376369476318},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.14180424809455872},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06153082847595215},{"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/3457606","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3457606","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3457606","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1811.00970","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.00970","pdf_url":"https://arxiv.org/pdf/1811.00970","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:34294","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/34294/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Journal of the ACM, 2021, Vol.68(4), pp.1-66 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1271948","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1271948","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":null,"raw_type":"Journal Article"},{"id":"pmh:oai:pure.atira.dk:publications/0447dc1d-be02-4356-badc-a3101871a23a","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/0447dc1d-be02-4356-badc-a3101871a23a","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Barto , L , Bul\u00edn , J , Krokhin , A & Opr\u0161al , J 2021 , ' Algebraic Approach to Promise Constraint Satisfaction ' , Journal of the ACM , vol. 68 , no. 4 , 28 . https://doi.org/10.1145/3457606","raw_type":"article"},{"id":"doi:10.4230/lipics.mfcs.2021.11","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2021.11","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.stacs.2021.10","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2021.10","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3457606","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3457606","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3457606","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6000000238418579}],"awards":[{"id":"https://openalex.org/G114714254","display_name":null,"funder_award_id":"EP/R034516/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G1734839658","display_name":"The Complexity of Promise Constraint Satisfaction","funder_award_id":"EP/R034516/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6203253224","display_name":null,"funder_award_id":"/SCI/022","funder_id":"https://openalex.org/F4320309755","funder_display_name":"Univerzita Karlova v Praze"},{"id":"https://openalex.org/G6295888907","display_name":"Clonoids: a unifying approach to equational logic and clones","funder_award_id":"P29931","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G6571278952","display_name":null,"funder_award_id":"UNCE/SCI/022","funder_id":"https://openalex.org/F4320309755","funder_display_name":"Univerzita Karlova v Praze"},{"id":"https://openalex.org/G6891524259","display_name":"Expanding the Scope of Universal Algebra","funder_award_id":"GA18-20123S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320309755","display_name":"Univerzita Karlova v Praze","ror":"https://ror.org/024d6js02"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2898776142.pdf","grobid_xml":"https://content.openalex.org/works/W2898776142.grobid-xml"},"referenced_works_count":101,"referenced_works":["https://openalex.org/W592083696","https://openalex.org/W655258421","https://openalex.org/W818708728","https://openalex.org/W1148390943","https://openalex.org/W1486752157","https://openalex.org/W1492972816","https://openalex.org/W1506951734","https://openalex.org/W1527777107","https://openalex.org/W1534682606","https://openalex.org/W1570219696","https://openalex.org/W1601269853","https://openalex.org/W1969999211","https://openalex.org/W1970259241","https://openalex.org/W1999032440","https://openalex.org/W2003464009","https://openalex.org/W2003995429","https://openalex.org/W2012910500","https://openalex.org/W2018470381","https://openalex.org/W2019578639","https://openalex.org/W2020154454","https://openalex.org/W2020661143","https://openalex.org/W2025319967","https://openalex.org/W2025904765","https://openalex.org/W2026753685","https://openalex.org/W2034079307","https://openalex.org/W2035932556","https://openalex.org/W2038691311","https://openalex.org/W2047281923","https://openalex.org/W2047861934","https://openalex.org/W2049516232","https://openalex.org/W2052726983","https://openalex.org/W2077575555","https://openalex.org/W2078752178","https://openalex.org/W2080578129","https://openalex.org/W2091694652","https://openalex.org/W2094548115","https://openalex.org/W2102459557","https://openalex.org/W2104254886","https://openalex.org/W2110541691","https://openalex.org/W2111385661","https://openalex.org/W2115404728","https://openalex.org/W2116407296","https://openalex.org/W2132991500","https://openalex.org/W2138779116","https://openalex.org/W2148352980","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2162481025","https://openalex.org/W2166566648","https://openalex.org/W2169474499","https://openalex.org/W2169488047","https://openalex.org/W2318083694","https://openalex.org/W2388408070","https://openalex.org/W2472217601","https://openalex.org/W2481850364","https://openalex.org/W2517090651","https://openalex.org/W2519488296","https://openalex.org/W2523377094","https://openalex.org/W2541797201","https://openalex.org/W2591501209","https://openalex.org/W2591988591","https://openalex.org/W2592282387","https://openalex.org/W2594596354","https://openalex.org/W2600945321","https://openalex.org/W2613504727","https://openalex.org/W2617920474","https://openalex.org/W2743203358","https://openalex.org/W2747410788","https://openalex.org/W2758570758","https://openalex.org/W2775735346","https://openalex.org/W2776885602","https://openalex.org/W2796460935","https://openalex.org/W2933224366","https://openalex.org/W2941546582","https://openalex.org/W2962785950","https://openalex.org/W2962988009","https://openalex.org/W2963255565","https://openalex.org/W2963295189","https://openalex.org/W2963454512","https://openalex.org/W2963666051","https://openalex.org/W2963768895","https://openalex.org/W2963777621","https://openalex.org/W2964303025","https://openalex.org/W2966098390","https://openalex.org/W2977636792","https://openalex.org/W2999363642","https://openalex.org/W3003147155","https://openalex.org/W3004384893","https://openalex.org/W3007452340","https://openalex.org/W3014119257","https://openalex.org/W3081785465","https://openalex.org/W3100051117","https://openalex.org/W3100367581","https://openalex.org/W3101924476","https://openalex.org/W3101990834","https://openalex.org/W3105924413","https://openalex.org/W3109442675","https://openalex.org/W3122541275","https://openalex.org/W3143668074","https://openalex.org/W3144422206","https://openalex.org/W4251337778"],"related_works":["https://openalex.org/W2161128834","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2097415053","https://openalex.org/W2012141606","https://openalex.org/W1550482496","https://openalex.org/W2784687883","https://openalex.org/W2102858635","https://openalex.org/W1527777107","https://openalex.org/W2012694101"],"abstract_inverted_index":{"The":[0,47,55,91,116],"complexity":[1,56,88,108,204],"and":[2,44,99,126,128,136,168,201,224],"approximability":[3,39],"of":[4,22,40,42,57,83,89,109,142,153,162,183,193,205,256],"the":[5,15,23,25,38,51,76,87,107,163,203,209,233],"constraint":[6,62,176],"satisfaction":[7],"problem":[8,167,182],"(CSP)":[9],"has":[10,29,68],"been":[11,31,70],"actively":[12],"studied":[13],"over":[14],"past":[16],"20":[17],"years.":[18],"A":[19],"new":[20,151],"version":[21],"CSP,":[24],"promise":[26],"CSP":[27],"(PCSP),":[28],"recently":[30,69],"proposed,":[32],"motivated":[33],"by":[34,75,124,220,239],"open":[35,98,103],"questions":[36],"about":[37],"variants":[41],"satisfiability":[43],"graph":[45,111,237],"colouring.":[46],"PCSP":[48,121,172],"significantly":[49,133],"extends":[50],"standard":[52],"decision":[53],"CSP.":[54],"CSPs":[58],"with":[59,173],"a":[60,65,150,174,181,191,252,257],"fixed":[61,175],"language":[63,177],"on":[64],"finite":[66],"domain":[67],"fully":[71],"classified,":[72],"greatly":[73],"guided":[74],"algebraic":[77,118,160,210],"approach,":[78],"which":[79],"uses":[80],"polymorphisms\u2014high-dimensional":[81],"symmetries":[82],"solution":[84],"spaces\u2014to":[85],"analyse":[86],"problems.":[90],"corresponding":[92],"classification":[93],"for":[94,199,242],"PCSPs":[95,207],"is":[96,178,196,248],"wide":[97],"includes":[100],"some":[101],"long-standing":[102],"questions,":[104],"such":[105],"as":[106,113,159],"approximate":[110,236],"colouring,":[112],"special":[114],"cases.":[115],"basic":[117],"approach":[119],"to":[120,144,180,189,250],"was":[122],"initiated":[123],"Brakensiek":[125],"Guruswami,":[127],"in":[129,235],"this":[130,184],"article,":[131],"we":[132,231],"extend":[134],"it":[135,138,247],"lift":[137],"from":[139],"concrete":[140],"properties":[141],"polymorphisms":[143],"their":[145],"abstract":[146],"properties.":[147],"We":[148,212],"introduce":[149],"class":[152],"problems":[154],"that":[155,170,195],"can":[156,217],"be":[157,218],"viewed":[158],"versions":[161],"(Gap)":[164],"Label":[165],"Cover":[166],"show":[169],"every":[171],"equivalent":[179],"form.":[185],"This":[186],"allows":[187],"us":[188],"identify":[190],"\u201cmeasure":[192],"symmetry\u201d":[194],"well":[197],"suited":[198],"comparing":[200],"relating":[202],"different":[206],"via":[208],"approach.":[211],"demonstrate":[213],"how":[214],"our":[215],"theory":[216],"applied":[219],"giving":[221],"both":[222],"general":[223],"specific":[225],"hardness/tractability":[226],"results.":[227],"Among":[228],"other":[229],"things,":[230],"improve":[232],"state-of-the-art":[234],"colouring":[238],"showing":[240],"that,":[241],"any":[243],"k":[244,254,259],"\u2265":[245],"3,":[246],"NP-hard":[249],"find":[251],"(2":[253],"-1)-colouring":[255],"given":[258],"-colourable":[260],"graph.":[261]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":16},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}