7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      The hardness of the closest vector problem with preprocessing

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references18

          • Record: found
          • Abstract: not found
          • Article: not found

          On Lovász’ lattice reduction and the nearest lattice point problem

          L Babai (1986)
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A hierarchy of polynomial time lattice basis reduction algorithms

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Minkowski's Convex Body Theorem and Integer Programming

                Bookmark

                Author and article information

                Journal
                IEEE Transactions on Information Theory
                IEEE Trans. Inform. Theory
                Institute of Electrical and Electronics Engineers (IEEE)
                00189448
                March 2001
                : 47
                : 3
                : 1212-1215
                Article
                10.1109/18.915688
                9ed1be5d-be73-4945-a4d6-73d8606ea385
                © 2001
                History

                Comments

                Comment on this article