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

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

      Combinatorica
      Springer Nature

      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.

          Abstract

          Related collections

          Most cited references4

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

          The ellipsoid method and its consequences in combinatorial optimization

            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem

            Adi Shamir (1982)
              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Solving low density subset sum problems

                Bookmark

                Author and article information

                Journal
                Combinatorica
                Combinatorica
                Springer Nature
                0209-9683
                1439-6912
                March 1986
                March 1986
                : 6
                : 1
                : 1-13
                Article
                10.1007/BF02579403
                6fb2634a-14f6-49c9-a66f-827abe64cf7d
                © 1986
                History

                Comments

                Comment on this article