{"id":"https://openalex.org/W2578970632","doi":"https://doi.org/10.1137/19m128212x","title":"Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy","display_name":"Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W2578970632","doi":"https://doi.org/10.1137/19m128212x","mag":"2578970632"},"language":"en","primary_location":{"id":"doi:10.1137/19m128212x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m128212x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/1704.01937","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Brakensiek","raw_affiliation_strings":["Stanford University ()"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0571,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78817463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"50","issue":"6","first_page":"1663","last_page":"1700"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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.9975000023841858,"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.7430143356323242},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7336673140525818},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6479083299636841},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5232048034667969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5165042281150818},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48999515175819397},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.43503522872924805},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41295409202575684}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7430143356323242},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7336673140525818},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6479083299636841},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5232048034667969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5165042281150818},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48999515175819397},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.43503522872924805},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41295409202575684},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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.1137/19m128212x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m128212x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1704.01937","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.01937","pdf_url":"https://arxiv.org/pdf/1704.01937","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2578970632","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1704.01937.pdf","pdf_url":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1704.01937","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1704.01937","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:2963255565","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc23.html#BrakensiekG16a","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1704.01937","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.01937","pdf_url":"https://arxiv.org/pdf/1704.01937","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5082161757","display_name":"AF: Small: The Polymorphic Gateway between Structure and Algorithms: Beyond CSP Dichotomy","funder_award_id":"1908125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6688699574","display_name":"AF: Small: Approximate optimization: Algorithms, Hardness, and Integrality Gaps","funder_award_id":"1526092","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7976889051","display_name":null,"funder_award_id":"CCF-1908125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8320020307","display_name":null,"funder_award_id":"CCF-1526092","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2578970632.pdf","grobid_xml":"https://content.openalex.org/works/W2578970632.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W130806391","https://openalex.org/W254482520","https://openalex.org/W1492972816","https://openalex.org/W1506951734","https://openalex.org/W1589711670","https://openalex.org/W1601269853","https://openalex.org/W1602309302","https://openalex.org/W1791050365","https://openalex.org/W1811185933","https://openalex.org/W1863800201","https://openalex.org/W1969999211","https://openalex.org/W1983032729","https://openalex.org/W1984074081","https://openalex.org/W1988961015","https://openalex.org/W1997649256","https://openalex.org/W2020154454","https://openalex.org/W2020661143","https://openalex.org/W2025319967","https://openalex.org/W2026753685","https://openalex.org/W2032487621","https://openalex.org/W2032980094","https://openalex.org/W2047861934","https://openalex.org/W2052936500","https://openalex.org/W2054605362","https://openalex.org/W2063191044","https://openalex.org/W2077575555","https://openalex.org/W2104254886","https://openalex.org/W2110871651","https://openalex.org/W2120358419","https://openalex.org/W2124452950","https://openalex.org/W2125578232","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2245150352","https://openalex.org/W2472217601","https://openalex.org/W2523377094","https://openalex.org/W2579513981","https://openalex.org/W2594596354","https://openalex.org/W2605361762","https://openalex.org/W2758570758","https://openalex.org/W2776885602","https://openalex.org/W2898776142","https://openalex.org/W2962785950","https://openalex.org/W2963777621","https://openalex.org/W2963887020","https://openalex.org/W2999363642","https://openalex.org/W3004384893","https://openalex.org/W3081785465"],"related_works":["https://openalex.org/W3186856097","https://openalex.org/W3007452340","https://openalex.org/W2963777621","https://openalex.org/W2776885602","https://openalex.org/W2150339067","https://openalex.org/W2026753685","https://openalex.org/W3037560153","https://openalex.org/W2966098390","https://openalex.org/W2963255565","https://openalex.org/W3194809555","https://openalex.org/W2569211458","https://openalex.org/W3013402004","https://openalex.org/W3081785465","https://openalex.org/W2962785950","https://openalex.org/W2116407296","https://openalex.org/W1601269853","https://openalex.org/W3007918591","https://openalex.org/W2169488047","https://openalex.org/W1997590411","https://openalex.org/W1555655798"],"abstract_inverted_index":{"A":[0,34],"classic":[1],"result":[2],"due":[3],"to":[4,92,197,271],"Schaefer":[5],"(1978)":[6],"classifies":[7],"all":[8],"constraint":[9],"satisfaction":[10],"problems":[11,109],"(CSPs)":[12],"over":[13,36],"the":[14,54,98,127,131,158,177,194,202,219,226,259,273],"Boolean":[15,135,280],"domain":[16],"as":[17,247,250,252],"being":[18],"either":[19,151],"in":[20,119,160,218],"$\\mathsf{P}$":[21],"or":[22,155],"$\\mathsf{NP}$-hard.":[23],"This":[24,122],"paper":[25,123],"considers":[26],"a":[27,37,47,71,83,147,191,244,276],"promise-problem":[28],"variant":[29],"of":[30,40,42,46,51,57,73,85,129,134,168,181,193,207,229,261,264,275],"CSPs":[31,52],"called":[32],"PCSPs.":[33,281],"PCSP":[35],"finite":[38,235],"set":[39,56,263],"pairs":[41],"constraints":[43],"$\u0393$":[44,161],"consists":[45],"pair":[48],"$(\u03a8_P,":[49,95],"\u03a8_Q)$":[50],"with":[53],"same":[55],"variables":[58],"such":[59],"that":[60,144,225],"for":[61,166,258,279],"every":[62],"$(P,":[63],"Q)":[64],"\\in":[65],"\u0393$,":[66],"$P(x_{i_1},":[67],"...,":[68,80],"x_{i_k})$":[69,81],"is":[70,82,91,101,105,124,150,190,237],"clause":[72,84],"$\u03a8_P$":[74,100],"if":[75,78],"and":[76,103,113,164,184,204,214,255],"only":[77],"$Q(x_{i_1},":[79],"$\u03a8_Q$.":[86],"The":[87],"promise":[88,136,231],"problem":[89],"$\\operatorname{PCSP}(\u0393)$":[90,145],"distinguish,":[93],"given":[94],"\u03a8_Q)$,":[96],"between":[97],"cases":[99],"satisfiable":[102],"$\u03a8_Q$":[104],"unsatisfiable.":[106],"Many":[107],"natural":[108],"including":[110],"approximate":[111],"graph":[112],"hypergraph":[114],"coloring":[115],"can":[116],"be":[117],"placed":[118],"this":[120,262],"framework.":[121],"motivated":[125],"by":[126,175,240],"pursuit":[128],"understanding":[130],"computational":[132,227],"complexity":[133,228],"CSPs.":[137,199],"As":[138],"our":[139,172,208],"main":[140],"result,":[141],"we":[142,210,223],"show":[143,224],"exhibits":[146],"dichotomy":[148,173,278],"(it":[149],"polynomial":[152],"time":[153],"solvable":[154],"$\\mathsf{NP}$-hard)":[156],"when":[157],"relations":[159],"are":[162],"symmetric":[163],"allow":[165],"negations":[167],"variables.":[169],"We":[170],"achieve":[171],"theorem":[174],"extending":[176],"weak":[178,242,265],"polymorphism":[179],"framework":[180],"Austrin,":[182],"Guruswami,":[183],"H\u00e5stad":[185],"[FOCS":[186],"'14]":[187],"which":[188],"itself":[189],"generalization":[192],"algebraic":[195],"approach":[196],"study":[198],"In":[200],"both":[201],"algorithm":[203],"hardness":[205],"portions":[206],"proof,":[209],"incorporate":[211],"new":[212],"ideas":[213],"techniques":[215],"not":[216],"utilized":[217],"CSP":[220,232],"case.":[221],"Furthermore,":[222],"any":[230],"(over":[233],"arbitrary":[234],"domains)":[236],"captured":[238],"entirely":[239],"its":[241],"polymorphisms,":[243],"feature":[245],"known":[246],"Galois":[248],"correspondence,":[249],"well":[251],"give":[253],"necessary":[254],"sufficient":[256],"conditions":[257],"structure":[260],"polymorphisms.":[266],"Such":[267],"insights":[268],"call":[269],"us":[270],"question":[272],"existence":[274],"general":[277]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}