[21] Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, and James Worrell. On Restricted Nonnegative Matrix Factorization. In Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi, editors, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), volume 55 of Leibniz International Proceedings in Informatics (LIPics), pages 103:1-103:14, 2016. doi:10.4230/LIPics.ICALP.2016.103.
[22] George Cybenko. Approximation by Superpositions of a Sigmoidal Function. Mathematics of Control, Signals and Systems, 2(4):303-314, 1989. doi:10.1007/BF02551274.
[23] Julian D'Costa, Engel Lefauchex, Eike Neumann, Joel Ouaknine, and James Worrel. On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. In Filippo Bonchi and Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), volume 202 of Leibniz International Proceedings in Informatics (LIPiCs), pages 33:1-33:21, 2021. doi: 10.4230/LIPiCs.MFCS.2021.33.
[24] Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, and Davi C. Tozoni. Engineering Art Galleries. In Lasse Kliemann and Peter Sanders, editors, Algorithm Engineering: Selected Results and Surveys, volume 9220 of Lecture Notes in Computer Science, pages 379-417. Springer, 1 edition, 2016. doi:10.1007/978-3-319-49487-6.
[25] Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, and Paul G. Spirakis. Approximating the Existential Theory of the Reals. Journal of Computer and System Sciences, 125:106-128, 2022. doi:10.1016/j.jcss.2021.11.002.
[26] Steffen Dereich and Sebastian Kassing. On Minimal Representations of Shallow ReLU Networks. Neural Networks, 148:121-128, 2022. doi:10.1016/j.neunet.2022.01.006.
[27] Santanu S. Dey, Guany Wang, and Yao Xie. Approximation Algorithms for Training One-Node ReLU Neural Networks. IEEE Transactions on Signal Processing, 68:6696-6706, 2020. doi:10.1109/TSP.2020.3039360.
[28] Ilias Diakonikolas, Surbhi Goel, Sushrut Karmalkar, Adam R. Klivans, and Mahdi Soltanolkotabi. Approximation Schemes for ReLU Regression. In Jacob Abernethy and Shivani Agarwal, editors, Proceedings of Thirty Third Conference on Learning Theory (COLT 2020), volume 125 of Proceedings of Machine Learning Research, pages 1452-1485, 2020.
[29] Michael G. Dobbins, Andreas Holmsen, and Tillmann Miltzow. A Universality Theorem for Nested Polytopes. arXiv preprint, 2019. arXiv:1908.02213.
[30] Michael G. Dobbins, Linda Kleist, Tillmann Miltzow, and Paweł Rzążewski. Completeness for the Complexity Class  $\forall \exists \mathbb{R}$  and Area-Universality. Discrete & Computational Geometry, 2022. doi:10.1007/s00454-022-00381-0.
[31] Ronen Eldan and Ohad Shamir. The Power of Depth for Feedforward Neural Networks. In Vitaly Feldman, Alexander Rakhlin, and Ohad Shamir, editors, 29th Annual Conference on Learning Theory (COLT 2016), volume 49 of Proceedings of Machine Learning Research, pages 907–940, 2016.
[32] Jeff Erickson. Optimal Curve Straightening is  $\exists \mathbb{R}$ -Complete. arXiv preprint, 2019. arXiv: 1908.09400.
[33] Jeff Erickson, Ivor van der Hoog, and Tillmann Miltzow. Smoothing the gap between NP and ER. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 1022-1033, 2020. doi:10.1109/FOCS46700.2020.00099.
[34] Vincent Froese and Christoph Hertrich. Training Neural Networks is NP-Hard in Fixed Dimension. arXiv preprint, 2023. arXiv:2303.17045.
[35] Vincent Froese, Christoph Hertrich, and Rolf Niedermeier. The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. Journal of Artificial Intelligence Research, 74, 2022. doi:10.1613/jair.1.13547.
[36] Jugal Garg, Ruta Mehta, Vijay V. Vazirani, and Sadra Yazdanbod.  $\exists \mathbb{R}$ -Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria. ACM Transactions on Economics and Computation, 6(1):1:1-1:23, 2018. doi:10.1145/3175494.