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

From MaRDI portal
Revision as of 03:56, 3 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q55934039, #quickstatements; #temporary_batch_1712111774907)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1103557
Language Label Description Also known as
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