{"id":"https://openalex.org/W2142236338","doi":"https://doi.org/10.1145/2213977.2214004","title":"2 <sup> log1-\u03b5 <i>n</i> </sup> hardness for the closest vector problem with preprocessing","display_name":"2 <sup> log1-\u03b5 <i>n</i> </sup> hardness for the closest vector problem with preprocessing","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2142236338","doi":"https://doi.org/10.1145/2213977.2214004","mag":"2142236338"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214004","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214004","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-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Subhash A. Khot","raw_affiliation_strings":["New York University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"New York University, New York, NY, USA","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054229318","display_name":"Preyas Popat","orcid":null},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Preyas Popat","raw_affiliation_strings":["New York University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"New York University, New York, NY, USA","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063089732","display_name":"Nisheeth K. Vishnoi","orcid":"https://orcid.org/0000-0002-0255-1119"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"Nisheeth K. Vishnoi","raw_affiliation_strings":["Microsoft Research, Bangalore, India","Microsoft Research, Bangalore, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Bangalore, India","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research, Bangalore, India#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067917669"],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":2.0732,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.87628653,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"277","last_page":"288"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9987000226974487,"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/T12288","display_name":"Optimization and Search Problems","score":0.9930999875068665,"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/dtime","display_name":"DTIME","score":0.7692346572875977},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.749401330947876},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6842365860939026},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5797950029373169},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44477224349975586},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.41856834292411804},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37439125776290894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.361283540725708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2799254059791565},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1049528419971466},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.08481821417808533},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.07908964157104492}],"concepts":[{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.7692346572875977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.749401330947876},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6842365860939026},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5797950029373169},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44477224349975586},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.41856834292411804},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37439125776290894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.361283540725708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2799254059791565},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1049528419971466},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.08481821417808533},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.07908964157104492},{"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},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2213977.2214004","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214004","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-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1483324665","https://openalex.org/W1583211461","https://openalex.org/W1586488998","https://openalex.org/W1966034053","https://openalex.org/W1970259241","https://openalex.org/W1973270757","https://openalex.org/W1989510734","https://openalex.org/W2000956176","https://openalex.org/W2003159902","https://openalex.org/W2019578639","https://openalex.org/W2034056530","https://openalex.org/W2037426925","https://openalex.org/W2060296335","https://openalex.org/W2072331102","https://openalex.org/W2082647621","https://openalex.org/W2083175934","https://openalex.org/W2096478102","https://openalex.org/W2118222703","https://openalex.org/W2148352980","https://openalex.org/W2397159611","https://openalex.org/W2610313478","https://openalex.org/W3014312596","https://openalex.org/W3144422206"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W88624181","https://openalex.org/W2084764151","https://openalex.org/W2006346148","https://openalex.org/W2910428196","https://openalex.org/W2104933102","https://openalex.org/W2369939250","https://openalex.org/W3185655986","https://openalex.org/W2962814632","https://openalex.org/W1504200807"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2],"for":[3,49],"an":[4],"arbitrarily":[5],"small":[6],"constant":[7],"\u03b5>0,":[8],"assuming":[9],"NP\u2288":[10],"DTIME":[11],"(2logO":[12],"1-\u03b5":[13],"n),":[14],"the":[15,19,24,42],"preprocessing":[16],"versions":[17],"of":[18,46],"closest":[20],"vector":[21],"problem":[22,27],"and":[23],"nearest":[25],"codeword":[26],"are":[28],"hard":[29],"to":[30,53],"approximate":[31],"within":[32],"a":[33],"factor":[34,45],"better":[35],"than":[36],"2log1-\u03b5":[37],"n.":[38],"This":[39],"improves":[40],"upon":[41],"previous":[43],"hardness":[44],"(log":[47],"n)\u03b4":[48],"some":[50],"\u03b4>0":[51],"due":[52],"[AKKV05].":[54]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}