{"id":"https://openalex.org/W2056492141","doi":"https://doi.org/10.1145/1089023.1089027","title":"Hardness of approximating the shortest vector problem in lattices","display_name":"Hardness of approximating the shortest vector problem in lattices","publication_year":2005,"publication_date":"2005-09-01","ids":{"openalex":"https://openalex.org/W2056492141","doi":"https://doi.org/10.1145/1089023.1089027","mag":"2056492141"},"language":"en","primary_location":{"id":"doi:10.1145/1089023.1089027","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1089023.1089027","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, Georgia","Georgia Institute of Technology , Atlanta, Georgia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, Georgia","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Institute of Technology , Atlanta, Georgia","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067917669"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":10.9301,"has_fulltext":false,"cited_by_count":211,"citation_normalized_percentile":{"value":0.98282713,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"52","issue":"5","first_page":"789","last_page":"808"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9850000143051147,"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/lattice-problem","display_name":"Lattice problem","score":0.8277567625045776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6814728379249573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6218968629837036},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5778496861457825},{"id":"https://openalex.org/keywords/tensor-product","display_name":"Tensor product","score":0.5651719570159912},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.551138699054718},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5489136576652527},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5301312804222107},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.48987382650375366},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.47462356090545654},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4440363943576813},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43949195742607117},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4356365501880646},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4353835880756378},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4339067339897156},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4124952554702759},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2028825283050537},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.16340228915214539},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.14760783314704895},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08805304765701294},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05712008476257324}],"concepts":[{"id":"https://openalex.org/C168482242","wikidata":"https://www.wikidata.org/wiki/Q6497128","display_name":"Lattice problem","level":3,"score":0.8277567625045776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6814728379249573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6218968629837036},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5778496861457825},{"id":"https://openalex.org/C51255310","wikidata":"https://www.wikidata.org/wiki/Q1163016","display_name":"Tensor product","level":2,"score":0.5651719570159912},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.551138699054718},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5489136576652527},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5301312804222107},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.48987382650375366},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.47462356090545654},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4440363943576813},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43949195742607117},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4356365501880646},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4353835880756378},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4339067339897156},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4124952554702759},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2028825283050537},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16340228915214539},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.14760783314704895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08805304765701294},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05712008476257324},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1089023.1089027","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1089023.1089027","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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":42,"referenced_works":["https://openalex.org/W57720693","https://openalex.org/W149470655","https://openalex.org/W1485280854","https://openalex.org/W1496447390","https://openalex.org/W1499237070","https://openalex.org/W1505927501","https://openalex.org/W1512682067","https://openalex.org/W1536948141","https://openalex.org/W1788833175","https://openalex.org/W1822243375","https://openalex.org/W1971488652","https://openalex.org/W1973270757","https://openalex.org/W1976456789","https://openalex.org/W1977195026","https://openalex.org/W1989510734","https://openalex.org/W2001093624","https://openalex.org/W2008930715","https://openalex.org/W2012589104","https://openalex.org/W2013794527","https://openalex.org/W2015281423","https://openalex.org/W2026129593","https://openalex.org/W2037426925","https://openalex.org/W2050689197","https://openalex.org/W2068871408","https://openalex.org/W2077244027","https://openalex.org/W2097678797","https://openalex.org/W2114616381","https://openalex.org/W2118284443","https://openalex.org/W2141040012","https://openalex.org/W2142048307","https://openalex.org/W2144593761","https://openalex.org/W2150780437","https://openalex.org/W2155178472","https://openalex.org/W2169665116","https://openalex.org/W2169690324","https://openalex.org/W2172216987","https://openalex.org/W2517177595","https://openalex.org/W2986418635","https://openalex.org/W3014312596","https://openalex.org/W3144422206","https://openalex.org/W3217775779","https://openalex.org/W6676879625"],"related_works":["https://openalex.org/W4287965093","https://openalex.org/W2963697215","https://openalex.org/W3037620928","https://openalex.org/W3022319518","https://openalex.org/W2121488122","https://openalex.org/W2000333212","https://openalex.org/W1993913882","https://openalex.org/W3115255814","https://openalex.org/W1584635930","https://openalex.org/W2056492141"],"abstract_inverted_index":{"Let":[0],"p":[1,30],">":[2,74],"1":[3],"be":[4],"any":[5],"fixed":[6],"real.":[7],"We":[8],"show":[9,49],"that":[10,21,50,94,110,132],"assuming":[11],"NP":[12,40],"\u2288":[13,41],"RP,":[14],"there":[15,51],"is":[16,52,66,76,102,109],"no":[17,53],"polynomial":[18],"time":[19],"algorithm":[20,55],"approximates":[22],"the":[23,37,67,70,111,116,121,140],"Shortest":[24],"Vector":[25,89],"Problem":[26,90],"(SVP)":[27],"in":[28],"\u2113":[29],"norm":[31],"within":[32],"a":[33,83,126],"constant":[34,97],"factor.":[35],"Under":[36],"stronger":[38],"assumption":[39],"RTIME(2":[42],"poly":[43],"(log":[44,60,145],"n":[45,61,65,146],")":[46,62,147],"),":[47],"we":[48,133],"polynomial-time":[54],"with":[56],"approximation":[57],"ratio":[58],"2":[59,144],"1/2\u2212\u03f5":[63],"where":[64],"dimension":[68],"of":[69,129],"lattice":[71],"and":[72],"\u03f5":[73],"0":[75],"an":[77],"arbitrarily":[78],"small":[79],"constant.We":[80],"first":[81],"give":[82],"new":[84,127],"(randomized)":[85],"reduction":[86,101,117],"from":[87],"Closest":[88],"(CVP)":[91],"to":[92,138,143],"SVP":[93,112],"achieves":[95],"some":[96],"factor":[98,142],"hardness.":[99],"The":[100],"based":[103],"on":[104],"BCH":[105],"Codes.":[106],"Its":[107],"advantage":[108],"instances":[113],"produced":[114],"by":[115],"behave":[118],"well":[119],"under":[120],"augmented":[122],"tensor":[123,130],"product":[124,131],",":[125],"variant":[128],"introduce.":[134],"This":[135],"enables":[136],"us":[137],"boost":[139],"hardness":[141],"1/2-\u03f5":[148],".":[149]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":19},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":13}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}