Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis
Reference58 articles.
1. P. Abbasi, A. Klingler, T. Netzer, Approximate Completely Positive Semidefinite Rank, preprint (2020) arXiv: 2012.06471.
2. M. Abrahamsen, A. Adamaszek, T. Miltzow, The Art Gallery Problem is $$\exists \mathbb{R}$$-complete, in ACM S. Theory Comput. ACM, 2018. 65–73.
3. S. Arora, R. Ge, R. Kannan, A. Moitra, Computing a nonnegative matrix factorization — provably, in ACM S. Theory Comput. ACM, 2012. 145–162.
4. G. Averkov, V. Kaibel, S. Weltge, Maximum semidefinite and linear extension complexity of families of polytopes, Math. Program. 167 (2018) 381–394.
5. S. Basu, R. Pollack, M. Roy, On the combinatorial and algebraic complexity of quantifier elimination, J. ACM 43 (1996) 1002–1045.