On the computational complexity of membership problems for the completely positive cone and its dual

Peter James Clair Dickinson, Luuk Gijben

Research output: Contribution to journal › Article › Academic › peer-review

99 Citations (Scopus)
3 Downloads (Pure)

Fingerprint

Dive into the research topics of 'On the computational complexity of membership problems for the completely positive cone and its dual'. Together they form a unique fingerprint.