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

      The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations

      , , ,
      Journal of Computer and System Sciences
      Elsevier BV

      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 references16

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

          On the inherent intractability of certain coding problems (Corresp.)

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

            Optimization, approximation, and complexity classes

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

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

              L Babai (1986)
                Bookmark

                Author and article information

                Journal
                Journal of Computer and System Sciences
                Journal of Computer and System Sciences
                Elsevier BV
                00220000
                April 1997
                April 1997
                : 54
                : 2
                : 317-331
                Article
                10.1006/jcss.1997.1472
                6a16f389-14b2-4374-86f7-d3266d9f7be8
                © 1997

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article