{"id":"https://openalex.org/W3007452340","doi":"https://doi.org/10.1145/3313276.3316300","title":"Algebraic approach to promise constraint satisfaction","display_name":"Algebraic approach to promise constraint satisfaction","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W3007452340","doi":"https://doi.org/10.1145/3313276.3316300","mag":"3007452340"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316300","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316300","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316300","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316300","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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 in Prague, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University in 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":["University of Durham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of 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":["University of Durham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of 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":null,"fwci":10.949,"has_fulltext":true,"cited_by_count":53,"citation_normalized_percentile":{"value":0.99339639,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"602","last_page":"613"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8828513622283936},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6223145127296448},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.5789443254470825},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5495395660400391},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5116384625434875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49882054328918457},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48946845531463623},{"id":"https://openalex.org/keywords/homogeneous-space","display_name":"Homogeneous space","score":0.4675392508506775},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45308932662010193},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4459472894668579},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.4271215796470642},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4228581488132477},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.41457200050354004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4046926200389862},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.35843706130981445},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33541354537010193},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32204335927963257},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21228355169296265},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16833758354187012}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8828513622283936},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6223145127296448},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.5789443254470825},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5495395660400391},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5116384625434875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49882054328918457},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48946845531463623},{"id":"https://openalex.org/C96469262","wikidata":"https://www.wikidata.org/wiki/Q1324364","display_name":"Homogeneous space","level":2,"score":0.4675392508506775},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45308932662010193},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4459472894668579},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.4271215796470642},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4228581488132477},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.41457200050354004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4046926200389862},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.35843706130981445},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33541354537010193},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32204335927963257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21228355169296265},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16833758354187012},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3313276.3316300","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316300","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316300","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:27993","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/27993/","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":"Symposium on the Theory of Computing (STOC), Phoenix, USA, 23rd-26th June [Conference proceedings]","raw_type":"Conference item"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:28036","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/28036/","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":"(2019). Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019). New York: ACM, pp. 602-613","raw_type":"Book chapter"},{"id":"pmh:oai:durham-repository.worktribe.com:1142879","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1142879","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":"Presentation / Conference Contribution"},{"id":"pmh:oai:pure.atira.dk:publications/881b3772-bbd4-4e47-8043-214c59f4a6c0","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/881b3772-bbd4-4e47-8043-214c59f4a6c0","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":"Bul\u00edn , J , Krokhin , A & Opr\u0161al , J 2019 , Algebraic approach to promise constraint satisfaction . in M Charikar & E Cohen (eds) , STOC 2019 : Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery (ACM) , pp. 602\u2013613 , STOC '19 , Phoenix , Arizona , United States , 23/06/19 . https://doi.org/10.1145/3313276.3316300","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3313276.3316300","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316300","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316300","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6100000143051147}],"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/G1181263255","display_name":null,"funder_award_id":"UNCE/SCI/022, PRIMUS/SCI/12","funder_id":"https://openalex.org/F4320309755","funder_display_name":"Univerzita Karlova v Praze"},{"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/G2054564204","display_name":null,"funder_award_id":"681988","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European 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"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3007452340.pdf","grobid_xml":"https://content.openalex.org/works/W3007452340.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W818708728","https://openalex.org/W1492972816","https://openalex.org/W1506951734","https://openalex.org/W1534682606","https://openalex.org/W1601269853","https://openalex.org/W1969999211","https://openalex.org/W1999032440","https://openalex.org/W2003464009","https://openalex.org/W2020154454","https://openalex.org/W2025904765","https://openalex.org/W2026753685","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/W2104254886","https://openalex.org/W2111385661","https://openalex.org/W2116407296","https://openalex.org/W2132991500","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2169474499","https://openalex.org/W2240399375","https://openalex.org/W2472217601","https://openalex.org/W2519488296","https://openalex.org/W2523377094","https://openalex.org/W2541797201","https://openalex.org/W2600945321","https://openalex.org/W2613504727","https://openalex.org/W2620998635","https://openalex.org/W2747410788","https://openalex.org/W2758570758","https://openalex.org/W2775735346","https://openalex.org/W2776885602","https://openalex.org/W2884037933","https://openalex.org/W2894798516","https://openalex.org/W2898776142","https://openalex.org/W2962785950","https://openalex.org/W2962988009","https://openalex.org/W2963295189","https://openalex.org/W2963666051","https://openalex.org/W2963777621","https://openalex.org/W2964303025","https://openalex.org/W2966704335","https://openalex.org/W3004384893","https://openalex.org/W3082146116","https://openalex.org/W3101990834","https://openalex.org/W3144422206","https://openalex.org/W4253896228"],"related_works":["https://openalex.org/W1524973174","https://openalex.org/W1540285992","https://openalex.org/W2141935412","https://openalex.org/W2784687883","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2162117398","https://openalex.org/W2737098235","https://openalex.org/W2906226597","https://openalex.org/W4285464797"],"abstract_inverted_index":{"The":[0,47,55,95],"complexity":[1,56,92,112],"and":[2,44,103],"approximability":[3,39],"of":[4,22,40,42,57,85,93,113],"the":[5,15,23,25,38,51,76,91,111],"constraint":[6,62],"satisfaction":[7],"problem":[8],"(CSP)":[9],"has":[10,29,68],"been":[11,31,70],"actively":[12],"studied":[13],"over":[14],"last":[16],"20":[17],"years.":[18],"A":[19],"new":[20],"version":[21],"CSP,":[24],"promise":[26],"CSP":[27],"(PCSP)":[28],"recently":[30,69],"proposed,":[32],"motivated":[33],"by":[34,75],"open":[35,102,107],"questions":[36],"about":[37],"variants":[41],"satisfiability":[43],"graph":[45,115],"colouring.":[46],"PCSP":[48],"significantly":[49],"extends":[50],"standard":[52],"decision":[53],"CSP.":[54],"CSPs":[58],"with":[59],"a":[60,65],"fixed":[61],"language":[63],"on":[64],"finite":[66],"domain":[67],"fully":[71],"classified,":[72],"greatly":[73],"guided":[74],"algebraic":[77],"approach,":[78],"which":[79],"uses":[80],"polymorphisms":[81],"\u2014":[82,88],"high-dimensional":[83],"symmetries":[84],"solution":[86],"spaces":[87],"to":[89],"analyse":[90],"problems.":[94],"corresponding":[96],"classification":[97],"for":[98],"PCSPs":[99],"is":[100],"wide":[101],"includes":[104],"some":[105],"long-standing":[106],"questions,":[108],"such":[109],"as":[110,117],"approximate":[114],"colouring,":[116],"special":[118],"cases.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}