and Network Visualization (GD 2020), volume 12590 of Lecture Notes in Computer Science, pages 3-17, 2020. doi:10.1007/978-3-030-68766-3_1.
[6] Raman Arora, Amitabh Basu, Poorya Mianjy, and Anirbit Mukherjee. Understanding Deep Neural Networks with Rectified Linear Units. In International Conference on Learning Representations (ICLR 2018), 2018.
[7] Ainesh Bakshi, Rajesh Jayaram, and David P. Woodruff. Learning Two Layer Rectified Neural Networks in Polynomial Time. In Alina Beygelzimer and Daniel Hsu, editors, Proceedings of the Thirty-Second Conference on Learning Theory (COLT 2019), volume 99 of Proceedings of Machine Learning Research, pages 195–268, 2019.
[8] Marie L. T. Berthelsen and Kristoffer A. Hansen. On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. In Dimitris Fotakis and Evangelos Markakis, editors, International Symposium on Algorithmic Game Theory, volume 11801 of Lecture Notes in Computer Science, pages 153-167, 2019. doi:10.1007/978-3-030-30473-7_11.
[9] Daniel Bienstock, Gonzalo Muñoz, and Sebastian Pokutta. Principled Deep Neural Network Training through Linear Programming. Discrete Optimization, 49, 2023. doi:https://doi.org/10.1016/j.disopt.2023.100795.
[10] Vittorio Bilò and Marios Mavronicolas. A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. In Nicolas Ollinger and Heribert Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Leibniz International Proceedings in Informatics (LIPics), pages 17:1–17:13, 2016. doi:10.4230/LIPics.STACS.2016.17.
[11] Vittorio Bilò and Marios Mavronicolas. Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. In Vollmer Heribert and Brigitte Vallée, editors, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 13:1–13:14, 2017. doi:10.4230/LIPIcs.STACS.2017.13.
[12] Manon Blanc and Kristoffer A. Hansen. Computational Complexity of Multi-player Evolutionarily Stable Strategies. In Rahul Santhanam and Daniil Musatov, editors, Computer Science – Theory and Applications (CSR 2021), volume 12730 of Lecture Notes in Computer Science, pages 1–17, 2021. doi:10.1007/978-3-030-79416-3_1.
[13] Lenore Blum, Mike Shub, and Steve Smale. On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines. Bulletin of the American Mathematical Society, 21:1-46, 1989. doi:10.1090/S0273-0979-1989-15750-9.
[14] Digvijay Boob, Santanu S. Dey, and Guanghui Lan. Complexity of Training ReLU Neural Network. Discrete Optimization, 44(1), 2022. doi:10.1016/j.disopt.2020.100620.
[15] Alon Brutzkus and Amir Globerson. Globally Optimal Gradient Descent for a ConvNet with Gaussian Inputs. In Diana Precup and Yee W. Teh, editors, Proceedings of the 34th International Conference on Machine Learning (ICML 2017), volume 70 of Proceedings of Machine Learning Research, pages 605-614, 2017.
[16] Peter Burgisser and Felipe Cucker. Exotic Quantifiers, Complexity Classes, and Complete Problems. Foundations of Computational Mathematics, 9(2):135-170, 2009. doi:10.1007/s10208-007-9006-9.
[17] John Canny. Some Algebraic and Geometric Computations in PSPACE. In STOC '88: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 460-467, 1988. doi:10.1145/62212.62257.
[18] Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, and Birgit Vogtenhuber. Intersection Graphs of Rays and Grounded Segments. Journal of Graph Algorithms and Applications, 22(2):273-294, 2018. doi:10.7155/jgaa.00470.
[19] Sitan Chen, Aravind Gollakota, Adam R. Klivans, and Raghu Meka. Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks. arXiv preprint, 2022. arXiv:2202.05258.
[20] Sitan Chen, Adam R. Klivans, and Raghu Meka. Learning Deep ReLU Networks Is Fixed-Parameter Tractable. In Nisheeth K. Vishnoi, editor, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 696–707, 2022. doi:10.1109/F0CS52979.2021.00073.