{"id":"https://openalex.org/W4233411607","doi":"https://doi.org/10.1137/130929394","title":"Making the Long Code Shorter","display_name":"Making the Long Code Shorter","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W4233411607","doi":"https://doi.org/10.1137/130929394"},"language":"en","primary_location":{"id":"doi:10.1137/130929394","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130929394","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5102710346","display_name":"Boaz Barak","orcid":"https://orcid.org/0000-0002-4053-8927"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Boaz Barak","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036468719","display_name":"Parikshit Gopalan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Parikshit Gopalan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013166918","display_name":"Johan H\u00e5stad","orcid":"https://orcid.org/0000-0002-5379-345X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Johan H\u00e5stad","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044675813","display_name":"Raghu Meka","orcid":"https://orcid.org/0009-0004-7676-2762"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raghu Meka","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101701586","display_name":"Prasad Raghavendra","orcid":"https://orcid.org/0009-0009-7851-0653"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prasad Raghavendra","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089128021","display_name":"David Steurer","orcid":"https://orcid.org/0000-0002-3908-8180"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Steurer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5102710346"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4021,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8414393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"44","issue":"5","first_page":"1287","last_page":"1324"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7769812345504761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.600295901298523},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5458143949508667},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5189980268478394},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.4727284014225006},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4726264178752899},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46017706394195557},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45780041813850403},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42625629901885986},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.41236168146133423},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3229570984840393}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7769812345504761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.600295901298523},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5458143949508667},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5189980268478394},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.4727284014225006},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4726264178752899},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46017706394195557},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45780041813850403},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42625629901885986},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.41236168146133423},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3229570984840393},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/130929394","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130929394","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2049143039","https://openalex.org/W2087038607","https://openalex.org/W2117220151","https://openalex.org/W2146453677","https://openalex.org/W2148858749","https://openalex.org/W2568404849"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W4292947165","https://openalex.org/W587735977","https://openalex.org/W3045121788","https://openalex.org/W3201655533","https://openalex.org/W3134442314","https://openalex.org/W2281248943"],"abstract_inverted_index":{"The":[0],"long":[1],"code":[2,24,43],"is":[3,26],"a":[4,22,161,211],"central":[5],"tool":[6],"in":[7,12,35,223],"hardness":[8],"of":[9,37,63,71,100,106,115,163,174,190,195,205,217],"approximation,":[10],"especially":[11],"questions":[13],"related":[14,225],"to":[15,232],"the":[16,41,53,61,107,128,132,168,191,196,201,214,234,238],"Unique":[17,147,182],"Games":[18,148,183],"Conjecture.":[19],"We":[20,209],"construct":[21],"new":[23,42],"that":[25,135,145,184],"exponentially":[27],"more":[28,82],"efficient,":[29],"but":[30,77],"can":[31,125],"still":[32],"be":[33],"used":[34],"many":[36],"these":[38],"applications.":[39],"Using":[40],"we":[44,59],"obtain":[45],"exponential":[46],"improvements":[47],"over":[48,127,167],"several":[49],"known":[50,170,203],"results,":[51],"including":[52],"following:":[54],"(1)":[55],"For":[56],"any":[57],"$\\varepsilon>0$,":[58],"show":[60,210],"existence":[62],"an":[64,97],"$n$-vertex":[65],"graph":[66,130,236],"$G$":[67],"where":[68,89],"every":[69],"set":[70],"$o(n)$":[72],"vertices":[73],"has":[74,81,136],"expansion":[75],"$1-\\varepsilon$,":[76,88],"$G$'s":[78],"adjacency":[79],"matrix":[80],"than":[83,87],"$\\exp(\\log^{\\delta}n)$":[84],"eigenvalues":[85],"larger":[86],"$\\delta$":[90],"depends":[91],"only":[92],"on":[93,113,131,200,237],"$\\varepsilon$.":[94],"This":[95],"answers":[96],"open":[98],"question":[99],"Arora,":[101],"Barak,":[102],"and":[103,220,228],"Steurer":[104],"[Proceedings":[105],"2010":[108],"IEEE":[109],"51st":[110],"Annual":[111],"Symposium":[112],"Foundations":[114],"Computer":[116],"Science,":[117],"2010,":[118],"pp.":[119],"563--572],":[120],"who":[121],"asked":[122],"whether":[123],"one":[124],"improve":[126],"noise":[129,235],"Boolean":[133,239],"hypercube":[134],"${\\rm":[137,206],"poly}(\\log":[138],"n)$":[139],"such":[140],"eigenvalues.":[141],"(2)":[142],"A":[143],"gadget":[144,171],"reduces":[146],"instances":[149,156],"with":[150,157,160,172],"linear":[151,218],"constraints":[152],"modulo":[153],"$K$":[154],"into":[155],"alphabet":[158],"$k$":[159],"blowup":[162,173],"$k^{{\\rm":[164],"polylog}(K)}$,":[165],"improving":[166,199],"previously":[169,202],"$k^{\\Omega(K)}$.":[175],"(3)":[176],"An":[177],"$n$-variable":[178],"integrality":[179],"gap":[180],"for":[181],"survives":[185],"$\\exp({\\rm":[186],"poly}(\\log\\log":[187,207],"n))$":[188],"rounds":[189],"semidefinite":[192],"programming":[193],"version":[194],"Sherali--Adams":[197],"hierarchy,":[198],"bound":[204],"n)$.":[208],"connection":[212,231],"between":[213],"local":[215],"testability":[216],"codes":[219],"Small-Set":[221],"Expansion":[222],"certain":[224],"Cayley":[226],"graphs":[227],"use":[229],"this":[230],"derandomize":[233],"hypercube.":[240]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}