{"id":"https://openalex.org/W4399523067","doi":"https://doi.org/10.1145/3618260.3649613","title":"How Random CSPs Fool Hierarchies","display_name":"How Random CSPs Fool Hierarchies","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399523067","doi":"https://doi.org/10.1145/3618260.3649613"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649613","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649613","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649613","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649613","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5099087247","display_name":"Siu On Chan","orcid":"https://orcid.org/0000-0003-4558-4452"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Siu On Chan","raw_affiliation_strings":["Unaffiliated, Hong Kong, China"],"raw_orcid":"https://orcid.org/0000-0003-4558-4452","affiliations":[{"raw_affiliation_string":"Unaffiliated, Hong Kong, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101876125","display_name":"Hiu Tsun Ng","orcid":"https://orcid.org/0009-0007-2272-165X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Hiu Tsun Ng","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, China"],"raw_orcid":"https://orcid.org/0009-0007-2272-165X","affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sijin Peng","orcid":"https://orcid.org/0009-0007-4377-1437"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sijin Peng","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"raw_orcid":"https://orcid.org/0009-0007-4377-1437","affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3205,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58700885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1944","last_page":"1955"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9945999979972839,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6694331765174866},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6582754850387573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6296274065971375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5903569459915161},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.559719443321228},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.49142301082611084},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4893924295902252},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46940577030181885},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.44865626096725464},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.42610540986061096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1821047067642212},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16651690006256104},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.07585301995277405},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.06624096632003784}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6694331765174866},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6582754850387573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6296274065971375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5903569459915161},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.559719443321228},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.49142301082611084},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4893924295902252},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46940577030181885},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.44865626096725464},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.42610540986061096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1821047067642212},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16651690006256104},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.07585301995277405},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.06624096632003784},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649613","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649613","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649613","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649613","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649613","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649613","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4399523067.pdf"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1973898585","https://openalex.org/W2002025272","https://openalex.org/W2022749269","https://openalex.org/W2028085501","https://openalex.org/W2031364557","https://openalex.org/W2045417786","https://openalex.org/W2048564574","https://openalex.org/W2072802070","https://openalex.org/W2084384424","https://openalex.org/W2107052785","https://openalex.org/W2129413084","https://openalex.org/W2138341424","https://openalex.org/W2165281529","https://openalex.org/W2179897858","https://openalex.org/W2185716868","https://openalex.org/W2345432430","https://openalex.org/W2408897693","https://openalex.org/W2514739098","https://openalex.org/W2530117330","https://openalex.org/W2574497079","https://openalex.org/W2758570758","https://openalex.org/W2884037933","https://openalex.org/W2898776142","https://openalex.org/W2962785950","https://openalex.org/W2977636792","https://openalex.org/W2999363642","https://openalex.org/W3013808376","https://openalex.org/W3081785465","https://openalex.org/W3085100594","https://openalex.org/W4206427716","https://openalex.org/W4206545712","https://openalex.org/W4283769947","https://openalex.org/W4293248662","https://openalex.org/W4313227180","https://openalex.org/W4313227603","https://openalex.org/W4316128846","https://openalex.org/W4316652373","https://openalex.org/W4316652390","https://openalex.org/W4376639551"],"related_works":["https://openalex.org/W1983756092","https://openalex.org/W2365264209","https://openalex.org/W2381295697","https://openalex.org/W2385886188","https://openalex.org/W962203960","https://openalex.org/W2026999166","https://openalex.org/W2378309693","https://openalex.org/W579949368","https://openalex.org/W1599954583","https://openalex.org/W1788812054"],"abstract_inverted_index":{"Relaxations":[0],"for":[1,50,73,86],"the":[2,21,42,64,105,128,133],"constraint":[3],"satisfaction":[4],"problem":[5],"(CSP)":[6],"include":[7],"bounded":[8],"width,":[9],"linear":[10,66],"program":[11,14,18],"(LP),":[12],"semidefinite":[13],"(SDP),":[15],"affine":[16],"integer":[17],"(AIP),":[19],"and":[20,28,38,58,75,114,118,122,126],"combined":[22],"LP+AIP":[23,43,74],"of":[24,89,93],"Brakensiek,":[25],"Guruswami,":[26],"Wrochna,":[27],"\u017divn\u00fd":[29,59],"(SICOMP":[30],"2020).":[31],"Tightening":[32],"relaxations":[33],"systematically":[34],"leads":[35],"to":[36,102],"hierarchies":[37,104],"stronger":[39,77],"algorithms.":[40],"For":[41,80],"hierarchy,":[44,82],"a":[45,90],"constant":[46],"level":[47,70],"lower":[48,71,107],"bound":[49,72,84,108],"approximate":[51],"graph":[52],"coloring":[53],"was":[54],"given":[55],"by":[56],"Ciardo":[57],"(STOC":[60,124],"2023).":[61],"We":[62,100],"prove":[63],"first":[65],"(and":[67],"hence":[68],"optimal)":[69],"its":[76],"variant,":[78],"SDP+AIP.":[79],"each":[81],"our":[83],"holds":[85],"random":[87],"instances":[88],"broad":[91],"class":[92],"CSPs":[94],"that":[95],"we":[96],"call":[97],"\ud835\udf0f-wise":[98],"neutral.":[99],"extend":[101],"other":[103],"LP":[106],"techniques":[109],"in":[110,132],"Benabbas,":[111],"Georgiou,":[112],"Magen":[113],"Tulsiani":[115],"(ToC":[116],"2012)":[117],"Kothari,":[119],"Mori,":[120],"O\u2019Donnell,":[121],"Witmer":[123],"2017),":[125],"simplify":[127],"SDP":[129],"solution":[130],"construction":[131],"latter.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}