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

Title
On the computational complexity of membership problems for the completely positive cone and its dual
Authors
Keywords
Copositive, Completely positive, NP-hard, Stable set
Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 57, Issue 2, Pages 403-415
Publisher
Springer Nature
Online
2013-09-11
DOI
10.1007/s10589-013-9594-z

Ask authors/readers for more resources

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started