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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1103557
Language Label Description Also known as
default for all languages
No label defined
    English
    Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    scientific article; zbMATH DE number 1103557

      Statements

      Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (English)
      0 references
      0 references
      0 references
      28 January 1998
      0 references
      randomized approximation algorithms
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references