{"id":"https://openalex.org/W3196550748","doi":"https://doi.org/10.1145/3519935.3519955","title":"Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random","display_name":"Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W3196550748","doi":"https://doi.org/10.1145/3519935.3519955","mag":"3196550748"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3519955","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3519955","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519955","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 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519955","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["University of California at Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068103506","display_name":"Pravesh K. Kothari","orcid":"https://orcid.org/0000-0002-8689-6770"},"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":"Pravesh K. Kothari","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103039175","display_name":"Peter Manohar","orcid":"https://orcid.org/0000-0002-0732-5073"},"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":"Peter Manohar","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068388812"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":2.3596,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.89812396,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"678","last_page":"689"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9970999956130981,"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.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.7591919302940369},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7021663784980774},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.5571656227111816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5146937966346741},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5134993195533752},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5025331974029541},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4817952513694763},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4712068438529968},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.46288204193115234},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4459651708602905},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.44011110067367554},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40491873025894165},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40241873264312744},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.28228235244750977},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.10530036687850952},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10268530249595642}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.7591919302940369},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7021663784980774},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.5571656227111816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5146937966346741},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5134993195533752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5025331974029541},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4817952513694763},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4712068438529968},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.46288204193115234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4459651708602905},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.44011110067367554},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40491873025894165},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40241873264312744},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.28228235244750977},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.10530036687850952},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10268530249595642},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3519955","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3519955","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519955","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 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3519935.3519955","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3519955","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519955","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 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2584449986","display_name":"Graduate Research Fellowship Program (GRFP)","funder_award_id":"1745016","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3215946901","display_name":null,"funder_award_id":"DGE1745016","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3280610492","display_name":"CIF: Small: New Coding Techniques for Synchronization Errors","funder_award_id":"1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/G521757348","display_name":null,"funder_award_id":"CF-1814603","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/G6894402473","display_name":null,"funder_award_id":"Fellowship","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/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8958721119","display_name":null,"funder_award_id":"DGE174501","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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3196550748.pdf","grobid_xml":"https://content.openalex.org/works/W3196550748.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W124285993","https://openalex.org/W1528312239","https://openalex.org/W1873349594","https://openalex.org/W1985572324","https://openalex.org/W2027048490","https://openalex.org/W2028085501","https://openalex.org/W2031364557","https://openalex.org/W2033490419","https://openalex.org/W2058374373","https://openalex.org/W2077204415","https://openalex.org/W2098345409","https://openalex.org/W2113600113","https://openalex.org/W2125534993","https://openalex.org/W2138341424","https://openalex.org/W2153413398","https://openalex.org/W2158747250","https://openalex.org/W2339349649","https://openalex.org/W2345432430","https://openalex.org/W2574497079","https://openalex.org/W2914238450","https://openalex.org/W2952469246","https://openalex.org/W2962705766","https://openalex.org/W2962804816","https://openalex.org/W2972186810","https://openalex.org/W2978665793","https://openalex.org/W2996640527","https://openalex.org/W3014167315","https://openalex.org/W3047996194","https://openalex.org/W3085317570","https://openalex.org/W3098045837","https://openalex.org/W4206143864","https://openalex.org/W4235946010","https://openalex.org/W4254789177"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2155910042","https://openalex.org/W3021221643","https://openalex.org/W3184046060","https://openalex.org/W3061362066","https://openalex.org/W2626872748","https://openalex.org/W70192758","https://openalex.org/W2751025771","https://openalex.org/W3152212242","https://openalex.org/W1492779419"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,29,49],"algorithm":[3,58],"for":[4,114],"strongly":[5],"refuting":[6,115],"smoothed":[7,14,51],"instances":[8,118],"of":[9,32,40,53,73,83,108,110,119],"all":[10],"Boolean":[11],"CSPs.":[12,120],"The":[13],"model":[15],"is":[16,28,85],"a":[17,54],"hybrid":[18],"between":[19,102],"worst":[20],"and":[21,63,105],"average-case":[22],"input":[23,27],"models,":[24],"where":[25],"the":[26,33,37,41,70,81,100,106,111],"arbitrary":[30],"instance":[31,52],"CSP":[34],"with":[35,44,65],"only":[36],"negation":[38],"patterns":[39],"literals":[42],"re-randomized":[43],"some":[45],"small":[46],"probability.":[47],"For":[48],"n-variable":[50],"k-arity":[55],"CSP,":[56],"our":[57],"runs":[59],"in":[60,68,98],"n^O(\u2113)":[61],"time,":[62],"succeeds":[64],"high":[66],"probability":[67],"bounding":[69],"optimum":[71],"fraction":[72],"satisfiable":[74],"constraints":[75,84,109],"away":[76],"from":[77],"1,":[78],"provided":[79],"that":[80],"number":[82,107],"at":[86],"least":[87],"\u00d5(n)":[88],"(n/ell)^(k/2":[89],"-":[90],"1).":[91],"This":[92],"matches,":[93],"up":[94],"to":[95],"polylogarithmic":[96],"factors":[97],"n,":[99],"trade-off":[101],"running":[103],"time":[104],"state-of-the-art":[112],"algorithms":[113],"fully":[116],"random":[117]},"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":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}