On the computational complexity of membership problems for the completely positive cone and its dual (Q461444)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of membership problems for the completely positive cone and its dual |
scientific article |
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
