Citation Impact

Citing Papers

On the computational complexity of membership problems for the completely positive cone and its dual
2013
Most Tensor Problems Are NP-Hard
2013 Standout

Works of Werner Schachinger being referenced

Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization
2011
Rankless by CCL
2026