{"id":"https://openalex.org/W2999363642","doi":"https://doi.org/10.1137/20m1312745","title":"The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems","display_name":"The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2999363642","doi":"https://doi.org/10.1137/20m1312745","mag":"2999363642"},"language":"en","primary_location":{"id":"doi:10.1137/20m1312745","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1312745","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"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1907.04383","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Joshua Brakensiek","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joshua Brakensiek","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Venkatesan Guruswami","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Marcin Wrochna","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marcin Wrochna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Stanislav \u017divn\u00fd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stanislav \u017divn\u00fd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2817,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.90263549,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"49","issue":"6","first_page":"1232","last_page":"1248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4961000084877014,"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.4961000084877014,"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.33149999380111694,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.06700000166893005,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7057999968528748},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5067999958992004},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.48339998722076416},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4803999960422516},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.4519999921321869},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43209999799728394},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.3971000015735626},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.37929999828338623},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.37040001153945923},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.36559998989105225},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.3573000133037567}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7057999968528748},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5067999958992004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48980000615119934},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.48339998722076416},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4803999960422516},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.4519999921321869},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43209999799728394},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.3971000015735626},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.37929999828338623},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.37040001153945923},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3652999997138977},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.3573000133037567},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.35420000553131104},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.350600004196167},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.3492000102996826},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3488999903202057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3409999907016754},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33309999108314514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32670000195503235},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.31189998984336853},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C96469262","wikidata":"https://www.wikidata.org/wiki/Q1324364","display_name":"Homogeneous space","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.2858000099658966},{"id":"https://openalex.org/C3746008","wikidata":"https://www.wikidata.org/wiki/Q981351","display_name":"Symmetric function","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C188971069","wikidata":"https://www.wikidata.org/wiki/Q1636734","display_name":"Universal algebra","level":3,"score":0.27000001072883606},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.26100000739097595}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/20m1312745","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1312745","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:1907.04383","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.04383","pdf_url":"https://arxiv.org/pdf/1907.04383","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1907.04383","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.04383","pdf_url":"https://arxiv.org/pdf/1907.04383","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/G6751408502","display_name":null,"funder_award_id":"CCF-1814603","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/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1983032729","https://openalex.org/W2020154454","https://openalex.org/W2032980094","https://openalex.org/W2150339067","https://openalex.org/W2411816729","https://openalex.org/W2758570758","https://openalex.org/W2963666051"],"related_works":[],"abstract_inverted_index":{"In":[0,17,137],"the":[1,32,45,55,68,84,99,124,133,150,175,184],"field":[2],"of":[3,15,63,83,88,98,127,174,183,202,236],"constraint":[4,22,129],"satisfaction":[5],"problems":[6],"(CSPs),":[7],"promise":[8,19,65,114,155],"CSPs":[9,115,156,216],"are":[10,164,247],"an":[11],"exciting":[12,76],"new":[13,222],"direction":[14],"study.":[16],"a":[18,64,109,142,198,206,221],"CSP,":[20],"each":[21,128],"comes":[23],"in":[24,31,123,132,146],"two":[25,177],"forms:":[26],"\u201cstrict\u201d":[27],"and":[28,30,80,93,95,180,229],"\u201cweak,\u201d":[29],"associated":[33],"decision":[34,151],"problem":[35,152],"one":[36],"must":[37],"distinguish":[38],"between":[39],"being":[40,50],"able":[41,51],"to":[42,52,113,130,197,257],"satisfy":[43,53],"all":[44,54,154,212],"strict":[46,125],"constraints":[47],"versus":[48],"not":[49,248],"weak":[56,135],"constraints.":[57],"The":[58],"most":[59],"commonly":[60],"cited":[61],"example":[62],"CSP":[66],"is":[67],"approximate":[69],"graph":[70],"coloring":[71],"problem-which":[72],"has":[73],"recently":[74],"seen":[75],"progress":[77],"[Bul\u00edn,":[78],"Krokhin,":[79],"Oprs\u0306al,":[81],"Proceedings":[82,97,182],"Symposium":[85,100,185],"on":[86,101,117,186,224,233],"Theory":[87],"Computing,":[89],"2019,":[90,189],"pp.":[91,105,190],"602--613":[92],"Wrochna":[94],"\u017divn\u00fd,":[96],"Discrete":[102,187],"Algorithms,":[103,188],"2020,":[104],"1426--1435]":[106],"benefiting":[107],"from":[108],"systematic":[110],"algebraic":[111],"approach":[112],"based":[116],"\u201cpolymorphisms,\u201d":[118],"operations":[119],"that":[120,157,243],"map":[121],"tuples":[122,131],"form":[126],"corresponding":[134],"form.":[136],"this":[138,195,208,255],"work,":[139,258],"we":[140,241],"present":[141],"simple":[143],"algorithm":[144,196,210,256],"which":[145,163],"polynomial":[147],"time":[148],"solves":[149,211],"for":[153,254],"admit":[158],"infinitely":[159],"many":[160],"symmetric":[161,245],"polymorphisms,":[162],"invariant":[165],"under":[166],"arbitrary":[167],"coordinate":[168],"permutations.":[169],"This":[170],"generalizes":[171],"previous":[172],"work":[173],"first":[176],"authors":[178],"[Brakensiek":[179],"Guruswami,":[181],"436--455].":[191],"We":[192],"also":[193,252],"extend":[194],"more":[199],"general":[200],"class":[201],"block-symmetric":[203],"polymorphisms.":[204],"As":[205],"corollary,":[207],"single":[209],"polynomial-time":[213],"tractable":[214],"Boolean":[215],"simultaneously.":[217],"These":[218],"results":[219],"give":[220],"perspective":[223],"Schaefer's":[225],"classic":[226],"dichotomy":[227],"theorem":[228],"shed":[230],"further":[231],"light":[232],"how":[234],"symmetries":[235],"polymorphisms":[237,246],"enable":[238],"algorithms.":[239],"Finally,":[240],"show":[242],"block":[244],"only":[249],"sufficient":[250],"but":[251],"necessary":[253],"thus":[259],"establishing":[260],"its":[261],"precise":[262],"power.":[263]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2020-01-23T00:00:00"}