Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (Q4369893): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q55934039, #quickstatements; #temporary_batch_1712111774907 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/227683.227684 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985123706 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55934039 / rank | |||
Normal rank | |||
Latest revision as of 03:56, 3 April 2024
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
28 January 1998
0 references
randomized approximation algorithms
0 references
