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

      Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

      ,

      Journal of the ACM

      Association for Computing Machinery (ACM)

      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

          Author and article information

          Journal
          Journal of the ACM
          J. ACM
          Association for Computing Machinery (ACM)
          00045411
          November 1995
          : 42
          : 6
          : 1115-1145
          Article
          10.1145/227683.227684

          Comments

          Comment on this article