On the computational complexity of membership problems for the completely positive cone and its dual (Q461444)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational complexity of membership problems for the completely positive cone and its dual |
scientific article; zbMATH DE number 6353819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of membership problems for the completely positive cone and its dual |
scientific article; zbMATH DE number 6353819 |
Statements
On the computational complexity of membership problems for the completely positive cone and its dual (English)
0 references
10 October 2014
0 references
copositive
0 references
completely positive
0 references
NP-hard
0 references
stable set
0 references
0 references
0.8136572241783142
0 references
0.8048200607299805
0 references
0.7953630685806274
0 references
0.7931774854660034
0 references
0.7922735810279846
0 references
