{"id":"https://openalex.org/W2989790471","doi":"https://doi.org/10.1145/3470867","title":"The Complexity of Promise SAT on Non-Boolean Domains","display_name":"The Complexity of Promise SAT on Non-Boolean Domains","publication_year":2021,"publication_date":"2021-09-01","ids":{"openalex":"https://openalex.org/W2989790471","doi":"https://doi.org/10.1145/3470867","mag":"2989790471"},"language":"en","primary_location":{"id":"doi:10.1145/3470867","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3470867","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":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1911.09065","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alex Brandts","orcid":null},"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":true,"raw_author_name":"Alex Brandts","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Marcin Wrochna","orcid":null},"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":"Marcin Wrochna","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":null,"display_name":"Stanislav \u017divn\u00fd","orcid":null},"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":"Stanislav \u017divn\u00fd","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":2.7396,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.91210213,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"13","issue":"4","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.49390000104904175,"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.49390000104904175,"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.2581000030040741,"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.1467999964952469,"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/unary-operation","display_name":"Unary operation","score":0.8546000123023987},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6866000294685364},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6245999932289124},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.515999972820282},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4153999984264374},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.3828999996185303},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.3815999925136566},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.375}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8546000123023987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7480000257492065},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6866000294685364},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6245999932289124},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.515999972820282},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4952999949455261},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4153999984264374},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3968000113964081},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.3828999996185303},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.3815999925136566},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.375},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3693000078201294},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3677999973297119},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3531999886035919},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.3483000099658966},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33880001306533813},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.319599986076355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.267300009727478},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.2583000063896179}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3470867","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3470867","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:arXiv.org:1911.09065","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.09065","pdf_url":"https://arxiv.org/pdf/1911.09065","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.4230/lipics.icalp.2020.17","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2020.17","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1911.09065","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.09065","pdf_url":"https://arxiv.org/pdf/1911.09065","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3202555970","display_name":null,"funder_award_id":"714532","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1820801893","https://openalex.org/W1970259241","https://openalex.org/W1996426177","https://openalex.org/W2019578639","https://openalex.org/W2025904765","https://openalex.org/W2036265926","https://openalex.org/W2066776015","https://openalex.org/W2077925882","https://openalex.org/W2115404728","https://openalex.org/W2148352980","https://openalex.org/W2758570758","https://openalex.org/W2775735346","https://openalex.org/W2776885602","https://openalex.org/W2884037933","https://openalex.org/W2933224366","https://openalex.org/W3001387111","https://openalex.org/W3003147155","https://openalex.org/W3004384893","https://openalex.org/W3007452340","https://openalex.org/W3007912722","https://openalex.org/W4298227433","https://openalex.org/W6966667997"],"related_works":[],"abstract_inverted_index":{"While":[0],"3-SAT":[1],"is":[2,5,20,54,61,111,126],"NP-hard,":[3],"2-SAT":[4],"solvable":[6],"in":[7,44,62,160],"polynomial":[8],"time.":[9],"Austrin":[10],"et":[11],"al.":[12],"[SICOMP\u201917]":[13],"proved":[14,112],"a":[15,67,90,93,118,129],"result":[16],"known":[17],"as":[18,163],"\u201c(2+\u025b)-SAT":[19],"NP-hard.\u201d":[21],"They":[22],"showed":[23],"that":[24,32,49,77,140],"the":[25,114,133],"problem":[26,146],"of":[27,69,80,96,132,152,158],"distinguishing":[28],"k":[29],"-CNF":[30],"formulas":[31],"are":[33,50,78,144],"g":[34,42],"-satisfiable":[35],"(i.e.,":[36],"some":[37],"assignment":[38],"satisfies":[39],"at":[40],"least":[41],"literals":[43],"every":[45],"clause)":[46],"from":[47],"those":[48],"not":[51],"even":[52],"1-satisfiable":[53],"NP-hard":[55],"if":[56],"g/k":[57],"<":[58],"1/2":[59],"and":[60,83],"P":[63],"otherwise.":[64],"We":[65,138],"study":[66],"generalisation":[68],"SAT":[70],"on":[71,104,123,128],"arbitrary":[72,105],"finite":[73,106],"domains,":[74],"with":[75],"clauses":[76],"disjunctions":[79],"unary":[81],"constraints,":[82],"establish":[84],"analogous":[85],"behaviour.":[86],"Thus,":[87],"we":[88],"give":[89],"dichotomy":[91],"for":[92,155],"natural":[94],"fragment":[95],"promise":[97],"constraint":[98],"satisfaction":[99],"problems":[100,161],"(":[101],"PCSPs":[102],")":[103],"domains.":[107],"The":[108],"hardness":[109,157],"side":[110],"using":[113],"algebraic":[115,153],"approach":[116],"via":[117],"new":[119],"general":[120],"NP-hardness":[121],"criterion":[122],"polymorphisms,":[124],"which":[125],"based":[127],"gap":[130],"version":[131],"Layered":[134],"Label":[135],"Cover":[136],"problem.":[137],"show":[139],"previously":[141],"used":[142],"criteria":[143],"insufficient\u2014the":[145],"hence":[147],"gives":[148],"an":[149],"interesting":[150],"benchmark":[151],"techniques":[154],"proving":[156],"approximation":[159],"such":[162],"PCSPs.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":5}],"updated_date":"2026-05-17T08:19:37.847499","created_date":"2019-12-05T00:00:00"}