On semidefinite programming relaxations for the satisfiability problem (Q2386349)
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 2197195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On semidefinite programming relaxations for the satisfiability problem |
scientific article; zbMATH DE number 2197195 |
Statements
On semidefinite programming relaxations for the satisfiability problem (English)
0 references
22 August 2005
0 references
Satisfiability problem
0 references
Semidefinite programming
0 references
Combinatorial optimization
0 references
Global optimization
0 references
0.9323849081993104
0 references
0.9141858220100404
0 references
0.9127147197723388
0 references
0.8871397972106934
0 references
0.8861326575279236
0 references
