{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:48:11Z","timestamp":1725587291961},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_40","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"474-485","source":"Crossref","is-referenced-by-count":2,"title":["A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem"],"prefix":"10.1007","author":[{"given":"Per","family":"Austrin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhash","family":"Khot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions. In: Proc. 30th ACM Symposium on the Theory of Computing, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"issue":"3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motawani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"Journal of the ACM"},{"key":"40_CR4","unstructured":"Austrin, P., Khot, S.: A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. arXiv report 1010.1481"},{"issue":"6","key":"40_CR5","doi-asserted-by":"publisher","first-page":"2464","DOI":"10.1137\/070712109","volume":"39","author":"A. Bogdanov","year":"2010","unstructured":"Bogdanov, A., Viola, E.: Pseudorandom bits for polynomials. SIAM J. Comput.\u00a039(6), 2464\u20132486 (2010)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jcss.1999.1649","volume":"59","author":"J. Cai","year":"1999","unstructured":"Cai, J., Nerurkar, A.: Approximating the SVP to within a factor ( 1\u2009+\u20091\/dim \u03b5 ) is NP-hard under randomized reductions. Journal of Computer and Systems Sciences\u00a059(2), 221\u2013239 (1999)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-70575-8_24","volume-title":"Automata, Languages and Programming","author":"Q. Cheng","year":"2008","unstructured":"Cheng, Q., Wan, D.: Complexity of decoding positive-rate reed-solomon codes. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 283\u2013293. Springer, Heidelberg (2008)"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, Q., Wan, D.: A deterministic reduction for the gap minimum distance problem. In: Proceedings of the ACM Symposium on the Theory of Computing, pp. 33\u201338 (2009)","DOI":"10.1145\/1536414.1536421"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. In: Proc. 40th IEEE Symposium on Foundations of Computer Science (1999)","DOI":"10.1109\/SFFCS.1999.814620"},{"issue":"2","key":"40_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U. Feige","year":"1996","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. Journal of the ACM\u00a043(2), 268\u2013292 (1996)","journal-title":"Journal of the ACM"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Haviv, I., Regev, O.: Tensor-based hardness of the shortest vector problem to within almost polynomial factors. In: Proceedings of the ACM Symposium on the Theory of Computing, pp. 469\u2013477 (2007)","DOI":"10.1145\/1250790.1250859"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Khot, S.: Hardness of approximating the shortest vector problem in high L p norms. In: Proc. 44th IEEE Symposium on Foundations of Computer Science (2003)","DOI":"10.1109\/SFCS.2003.1238203"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Khot, S.: Hardness of approximating the shortest vector problem in lattices. In: Proc. 45th IEEE Symposium on Foundations of Computer Science, pp. 126\u2013135 (2004)","DOI":"10.1109\/FOCS.2004.31"},{"issue":"1","key":"40_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.4086\/toc.2009.v005a003","volume":"5","author":"S. Lovett","year":"2009","unstructured":"Lovett, S.: Unconditional pseudorandom generators for low degree polynomials. Theory of Computing\u00a05(1), 69\u201382 (2009)","journal-title":"Theory of Computing"},{"issue":"6","key":"40_CR15","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1137\/S0097539700373039","volume":"30","author":"D. Micciancio","year":"2000","unstructured":"Micciancio, D.: The shortest vector problem is NP-hard to approximate to within some constant. SIAM Journal on Computing\u00a030(6), 2008\u20132035 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"40_CR16","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A. Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Transactions on Information Theory\u00a043(6), 1757\u20131766 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"40_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00037-009-0273-5","volume":"18","author":"E. Viola","year":"2009","unstructured":"Viola, E.: The sum of d small-bias generators fools polynomials of degree d. Computational Complexity\u00a018(2), 209\u2013217 (2009)","journal-title":"Computational Complexity"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T21:48:01Z","timestamp":1560289681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}