{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T21:22:51Z","timestamp":1751923371505},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_22","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T18:47:16Z","timestamp":1194115636000},"page":"263-276","source":"Crossref","is-referenced-by-count":16,"title":["Approximating SVP \u221e to within Almost-Polynomial Factors Is NP-Hard"],"prefix":"10.1007","author":[{"given":"Irit","family":"Dinur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes and linear equations. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 724\u2013733, 1993.","DOI":"10.1109\/SFCS.1993.366815"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai. Generating hard instances of lattice problems. In Proc. 28th ACM Symp. on Theory of Computing, pages 99\u2013108, 1996.","DOI":"10.1145\/237814.237838"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 10\u201319, New York, May 23-26 1998. ACM Press.","DOI":"10.1145\/276698.276705"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"L. Babai. On Lov\u00e1sz\u2019s lattice reduction and the nearest lattice point problem. Combinatorica, 6:1\u201314, 1986.","journal-title":"Combinatorica"},{"key":"22_CR5","unstructured":"B. Bollob\u00e1s. Combinatorics. Cambridge University Press, 1986."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"J.Y. Cai and A. Nerurkar. Approximating the SVP to within a factor (1 + 1\/dim\u03b5) is NP-hard under randomized reductions. In Proc. of the 13th Annual IEEE Conference on Computational Complexity, pages 46\u201355. 1998.","DOI":"10.1006\/jcss.1999.1649"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"S. Cook. The complexity of theorem-proving procedures. In Proc. 3rd ACM Symp. on Theory of Computing, pages 151\u2013158, 1971.","DOI":"10.1145\/800157.805047"},{"key":"22_CR8","unstructured":"Dinur, Fischer, Kindler, Raz, and Safra. PCP characterizations of NP: Towards a polynomially-small error-probability. In STOC: ACM Symposium on Theory of Computing (STOC), 1999."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"I. Dinur, G. Kindler, R. Raz, and S. Safra. Approximating-CVP to within almost-polynomial factors is NP-hard. Manuscript, 1999.","DOI":"10.1007\/3-540-46521-9_22"},{"key":"22_CR10","unstructured":"Dinur, Kindler, and Safra. Approximating-CVP to within almost-polynomial factors is NP-hard. In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), 1998."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Andr\u00e1s Frank and \u00c9va Tardos. An application of simultaneous approximation in combinatorial optimization. In 26th Annual Symposium on Foundations of Computer Science, pages 459\u2013463, Portland, Oregon, 21-23 October 1985. IEEE.","DOI":"10.1109\/SFCS.1985.8"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich and S. Goldwasser. On the limits of non-approximability of lattice problems. In Proc. 30th ACM Symp. on Theory of Computing, pages 1\u20139, 1998.","DOI":"10.1145\/276698.276704"},{"issue":"3","key":"22_CR13","first-page":"265","volume":"9","author":"L. Levin","year":"1973","unstructured":"L. Levin. Universal'nyie perebornyie zadachi (universal search problems: in Russian). Problemy Peredachi Informatsii, 9(3):265\u2013266, 1973.","journal-title":"Problemy Peredachi Informatsii"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra, and L. Lov\u00e1sz. Factoring polynomials with rational coefficients. Math. Ann., 261:513\u2013534, 1982.","journal-title":"Math. Ann."},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"J.C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. Journal of the ACM, 32(1):229\u2013246, January 1985.","journal-title":"Journal of the ACM"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"D. Micciancio. The shortest vector in a lattice is hard to approximate to within some constant. In Proc. 39th IEEE Symp. on Foundations of Computer Science, 1998.","DOI":"10.1109\/SFCS.1998.743432"},{"key":"22_CR17","unstructured":"C.P. Schnorr. A hierarchy of polynomial-time basis reduction algorithms. In Proceedings of Conference on Algorithms, P\u00e9cs (Hungary), pages 375\u2013386. North-Holland, 1985."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T12:10:55Z","timestamp":1684066255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}