{"id":"https://openalex.org/W2063711222","doi":"https://doi.org/10.1145/2213977.2214061","title":"Robust satisfiability of constraint satisfaction problems","display_name":"Robust satisfiability of constraint satisfaction problems","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2063711222","doi":"https://doi.org/10.1145/2213977.2214061","mag":"2063711222"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214061","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071004419","display_name":"Libor Barto","orcid":"https://orcid.org/0000-0002-8481-6458"},"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"]},{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA","CZ"],"is_corresponding":true,"raw_author_name":"Libor Barto","raw_affiliation_strings":["Charles University & McMaster University, Prague, Czech Rep"],"affiliations":[{"raw_affiliation_string":"Charles University & McMaster University, Prague, Czech Rep","institution_ids":["https://openalex.org/I21250087","https://openalex.org/I98251732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045956843","display_name":"Marcin Kozik","orcid":"https://orcid.org/0000-0002-1839-4824"},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marcin Kozik","raw_affiliation_strings":["Jagiellonian University, Krakow, Poland"],"affiliations":[{"raw_affiliation_string":"Jagiellonian University, Krakow, Poland","institution_ids":["https://openalex.org/I126596746"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071004419"],"corresponding_institution_ids":["https://openalex.org/I21250087","https://openalex.org/I98251732"],"apc_list":null,"apc_paid":null,"fwci":7.9473,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.98003511,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"931","last_page":"940"},"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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.9243956208229065},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.7776858806610107},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7472022175788879},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.7320280075073242},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6865262389183044},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.6602598428726196},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.579705536365509},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.553839921951294},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5512804985046387},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5251540541648865},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.51799476146698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48187336325645447},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.44823402166366577},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43932870030403137},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4368913769721985},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4214555621147156},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37208908796310425},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3415919542312622},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31028667092323303},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14394444227218628}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.9243956208229065},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7776858806610107},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7472022175788879},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.7320280075073242},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6865262389183044},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.6602598428726196},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.579705536365509},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.553839921951294},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5512804985046387},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5251540541648865},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.51799476146698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48187336325645447},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.44823402166366577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43932870030403137},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4368913769721985},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4214555621147156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37208908796310425},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3415919542312622},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31028667092323303},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14394444227218628},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2213977.2214061","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W239769294","https://openalex.org/W1486752157","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2000151313","https://openalex.org/W2020154454","https://openalex.org/W2026753685","https://openalex.org/W2027524199","https://openalex.org/W2029110781","https://openalex.org/W2034079307","https://openalex.org/W2068190866","https://openalex.org/W2087038607","https://openalex.org/W2091694652","https://openalex.org/W2094135928","https://openalex.org/W2110871651","https://openalex.org/W2120358419","https://openalex.org/W2124452950","https://openalex.org/W2131464080","https://openalex.org/W2150339067","https://openalex.org/W2151577278","https://openalex.org/W2163094612","https://openalex.org/W2165732281","https://openalex.org/W2166566648","https://openalex.org/W2504838369","https://openalex.org/W2621263703","https://openalex.org/W3037608563","https://openalex.org/W6658851509"],"related_works":["https://openalex.org/W2141935412","https://openalex.org/W202947224","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2737098235","https://openalex.org/W2295056692","https://openalex.org/W2012141606","https://openalex.org/W2289160775","https://openalex.org/W2026125863"],"abstract_inverted_index":{"An":[0],"algorithm":[1],"for":[2,44],"a":[3,23,39],"constraint":[4,42,48],"satisfaction":[5,49],"problem":[6,50],"is":[7],"called":[8],"robust":[9,54],"if":[10],"it":[11],"outputs":[12],"an":[13,52],"assignment":[14],"satisfying":[15],"at":[16],"least":[17],"(1-g(\u03b5))-fraction":[18],"of":[19,41],"the":[20,46],"constraints":[21],"given":[22],"(1-\u03b5)-satisfiable":[24],"instance,":[25],"where":[26],"g(\u03b5)":[27],"->":[28,32],"0":[29],"as":[30],"\u03b5":[31],"0,":[33],"$g(0)=0.":[34],"Guruswami":[35],"and":[36],"Zhou":[37],"conjectured":[38],"characterization":[40],"languages":[43],"which":[45],"corresponding":[47],"admits":[51],"efficient":[53],"algorithm.":[55],"This":[56],"paper":[57],"confirms":[58],"their":[59],"conjecture.":[60]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}