{"id":"https://openalex.org/W232814632","doi":"https://doi.org/10.1145/1536414.1536457","title":"CSP gaps and reductions in the lasserre hierarchy","display_name":"CSP gaps and reductions in the lasserre hierarchy","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W232814632","doi":"https://doi.org/10.1145/1536414.1536457","mag":"232814632"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536457","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-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5057481716","display_name":"Madhur Tulsiani","orcid":null},"institutions":[{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]},{"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":"Madhur Tulsiani","raw_affiliation_strings":["UC Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057481716"],"corresponding_institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0111115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":null,"first_page":"303","last_page":"312"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9746000170707703,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9746000170707703,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9678000211715698,"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.9168999791145325,"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/combinatorics","display_name":"Combinatorics","score":0.8435032367706299},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7454173564910889},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5604009032249451},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5225762128829956},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.4911353290081024},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4875749945640564},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4470660984516144},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42834293842315674},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4224315881729126},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4171152114868164},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4118230938911438},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39098191261291504},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08884388208389282}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8435032367706299},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7454173564910889},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5604009032249451},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5225762128829956},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.4911353290081024},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4875749945640564},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4470660984516144},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42834293842315674},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4224315881729126},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4171152114868164},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4118230938911438},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39098191261291504},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08884388208389282},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1536414.1536457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536457","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-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.4488","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.4488","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2008/104/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.369.2665","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.369.2665","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ttic.uchicago.edu/~madhurt/Papers/reductions.pdf","raw_type":"text"},{"id":"mag:232814632","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1483324665","https://openalex.org/W1490233153","https://openalex.org/W1524356573","https://openalex.org/W1593162480","https://openalex.org/W1607580485","https://openalex.org/W1975810219","https://openalex.org/W2058422149","https://openalex.org/W2059187303","https://openalex.org/W2077397558","https://openalex.org/W2084384424","https://openalex.org/W2089247135","https://openalex.org/W2095933180","https://openalex.org/W2099022556","https://openalex.org/W2101644337","https://openalex.org/W2106264302","https://openalex.org/W2107052785","https://openalex.org/W2111385661","https://openalex.org/W2141815340","https://openalex.org/W2143698439","https://openalex.org/W2162898372","https://openalex.org/W2168669141","https://openalex.org/W2610782124"],"related_works":["https://openalex.org/W2002025272","https://openalex.org/W2034163095","https://openalex.org/W2083896132","https://openalex.org/W2951914620","https://openalex.org/W2962913778","https://openalex.org/W2950087375","https://openalex.org/W2570315187","https://openalex.org/W2949160485","https://openalex.org/W2276905128","https://openalex.org/W278947496","https://openalex.org/W2060363698","https://openalex.org/W2951555618","https://openalex.org/W3212436327","https://openalex.org/W2950485803","https://openalex.org/W1971195978","https://openalex.org/W2399491650","https://openalex.org/W2906052802","https://openalex.org/W2408351019","https://openalex.org/W2950509221","https://openalex.org/W2069816168"],"abstract_inverted_index":{"We":[0,59,102],"study":[1],"integrality":[2,25,112,144,195,218,237],"gaps":[3,26,108,113,122,145,219,242],"for":[4,27,32,62,109,114,123,166,182,199,202,209,241,243],"SDP":[5,39,121,184],"relaxations":[6],"of":[7,14,37,55,98,146,162,197,215,235,246],"constraint":[8],"satisfaction":[9],"problems,":[10,29],"in":[11,244],"the":[12,23,35,38,42,56,63,79,88,99,183,212,226,236,256,262],"hierarchy":[13],"SDPs":[15],"defined":[16],"by":[17,186],"Lasserre.":[18],"Schoenebeck":[19],"[23]":[20],"recently":[21],"showed":[22],"first":[24,213],"these":[28],"showing":[30],"that":[31,61],"MAX":[33,65],"k-XOR,":[34],"ratio":[36,69],"optimum":[40,44],"to":[41,106],"integer":[43],"may":[45],"be":[46,71],"as":[47,49,72,74],"large":[48,73],"2":[50],"even":[51,94,152,260],"after":[52,95,153],"\u03a9(n)":[53,96,187,216],"rounds":[54,97],"Lasserre":[57,100],"hierarchy.":[58,101],"show":[60,143,193],"general":[64],"k-CSP":[66],"problem,":[67],"this":[68],"can":[70],"2k/2k":[75],"-":[76,85],"\u03b5":[77,86],"when":[78,87],"alphabet":[80,89],"is":[81],"binary":[82],"and":[83,119,132,139,231,249],"qk/q(q-1)k":[84],"size":[90],"a":[91,179,203],"prime":[92],"q,":[93],"also":[103],"explore":[104],"how":[105],"translate":[107],"CSP":[110],"into":[111],"other":[115],"problems":[116],"using":[117],"reductions,":[118],"establish":[120],"Maximum":[124],"Independent":[125,137,247],"Set,":[126],"Approximate":[127,163],"Graph":[128,164],"Coloring,":[129,165],"Chromatic":[130,140,250],"Number":[131,251],"Minimum":[133],"Vertex":[134,190],"Cover.":[135],"For":[136,189],"Set":[138,248],"Number,":[141],"we":[142,170,192],"n/2O(\u221a(log":[147],"n":[148,155],"log":[149,150,156,157],"n))":[151,158],"2\u03a9(\u221a(log":[154],"rounds.":[159,188],"In":[160],"case":[161,245],"every":[167],"constant":[168,205],"l,":[169],"construct":[171],"graphs":[172],"with":[173],"chromatic":[174],"number":[175],"\u03a9(2l/2/l2),":[176],"which":[177,252],"admit":[178],"vector":[180],"l-coloring":[181],"obtained":[185],"Cover,":[191],"an":[194],"gap":[196,238],"1.36":[198],"\u03a9(n\u03b4)":[200],"rounds,":[201],"small":[204],"\u03b4.":[206],"The":[207],"results":[208,222,258],"CSPs":[210],"provide":[211],"examples":[214],"round":[217],"matching":[220],"hardness":[221],"known":[223,259],"only":[224],"under":[225,261],"Unique":[227,263],"Games":[228,264],"Conjecture.":[229,265],"This":[230],"some":[232],"additional":[233],"properties":[234],"instance,":[239],"allow":[240],"are":[253],"stronger":[254],"than":[255],"NP-hardness":[257]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}