{"id":"https://openalex.org/W4376639550","doi":"https://doi.org/10.1145/3564246.3585180","title":"SDPs and Robust Satisfiability of Promise CSP","display_name":"SDPs and Robust Satisfiability of Promise CSP","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639550","doi":"https://doi.org/10.1145/3564246.3585180"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585180","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585180","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585180","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 55th Annual ACM 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/3564246.3585180","any_repository_has_fulltext":null},"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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037047447","display_name":"Sai Sandeep","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sai Sandeep","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.779,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.95185669,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"609","last_page":"622"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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.9994000196456909,"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.8488383889198303},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.731062114238739},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6559993624687195},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6189043521881104},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5403715372085571},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4972741901874542},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4712443947792053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43301117420196533},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.42526301741600037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3994174003601074},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08960002660751343}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8488383889198303},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.731062114238739},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6559993624687195},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6189043521881104},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5403715372085571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4972741901874542},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4712443947792053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43301117420196533},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.42526301741600037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3994174003601074},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08960002660751343},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585180","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585180","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585180","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 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585180","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585180","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585180","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 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639550.pdf","grobid_xml":"https://content.openalex.org/works/W4376639550.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W1971195978","https://openalex.org/W1999032440","https://openalex.org/W2002025272","https://openalex.org/W2020154454","https://openalex.org/W2025319967","https://openalex.org/W2026753685","https://openalex.org/W2063191044","https://openalex.org/W2088168476","https://openalex.org/W2094135928","https://openalex.org/W2096478102","https://openalex.org/W2107052785","https://openalex.org/W2110871651","https://openalex.org/W2116407296","https://openalex.org/W2166566648","https://openalex.org/W2168669141","https://openalex.org/W2411816729","https://openalex.org/W2560316516","https://openalex.org/W2594596354","https://openalex.org/W2611404581","https://openalex.org/W2621263703","https://openalex.org/W2758570758","https://openalex.org/W2884037933","https://openalex.org/W2898776142","https://openalex.org/W2941546582","https://openalex.org/W2962785950","https://openalex.org/W2964303025","https://openalex.org/W2989790471","https://openalex.org/W2999363642","https://openalex.org/W3001387111","https://openalex.org/W3003147155","https://openalex.org/W3081785465","https://openalex.org/W3129403085","https://openalex.org/W3139029615","https://openalex.org/W3177905337","https://openalex.org/W3186467916","https://openalex.org/W3194809555","https://openalex.org/W3212768336","https://openalex.org/W4206427716","https://openalex.org/W4226007258","https://openalex.org/W4239226380","https://openalex.org/W4309217195","https://openalex.org/W4316652390","https://openalex.org/W4376639550"],"related_works":["https://openalex.org/W4294619070","https://openalex.org/W2978292195","https://openalex.org/W2182740669","https://openalex.org/W78199058","https://openalex.org/W1524973174","https://openalex.org/W2212825795","https://openalex.org/W2611179704","https://openalex.org/W2118406528","https://openalex.org/W4376639550","https://openalex.org/W4206427716"],"abstract_inverted_index":{"For":[0],"a":[1,6,52,70,87],"constraint":[2],"satisfaction":[3,8,36],"problem":[4],"(CSP),":[5],"robust":[7,35,81],"algorithm":[9,56,82],"is":[10,27,83],"one":[11],"that":[12,23,29,32],"outputs":[13],"an":[14],"assignment":[15],"satisfying":[16],"most":[17],"of":[18,41,69],"the":[19,30,62,66,80],"constraints":[20],"on":[21,85],"instances":[22],"are":[24,38],"near-satisfiable.":[25],"It":[26],"known":[28],"CSPs":[31,45],"admit":[33],"efficient":[34],"algorithms":[37],"precisely":[39],"those":[40],"bounded":[42,71],"width,":[43],"i.e.,":[44],"whose":[46],"satisfiability":[47,68],"can":[48,74],"be":[49,75],"checked":[50,76],"by":[51,77],"simple":[53],"local":[54],"consistency":[55],"(eg.,":[57],"2-SAT":[58],"or":[59],"Horn-SAT":[60],"in":[61],"Boolean":[63],"case).":[64],"While":[65],"exact":[67],"width":[72],"CSP":[73],"combinatorial":[78],"algorithms,":[79],"based":[84],"rounding":[86],"canonical":[88],"Semi":[89],"Definite":[90],"Programming(SDP)":[91],"relaxation.":[92]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}