[70] Daniel Richardson. Some Undecidable Problems Involving Elementary Functions of a Real Variable. The Journal of Symbolic Logic, 33(4):514-520, 1969. doi:10.2307/2271358.
[71] Jürgen Richter-Gebert and Günter M. Ziegler. Realization Spaces of 4-Polytopes are Universal. Bulletin of the American Mathematical Society, 32(4):403-412, 1995. doi:10.1090/S0273-0979-1995-00604-X.
[72] Itay Safran and Ohad Shamir. Depth-Width Tradeoffs in Approximating Natural Functions with Neural Networks. In Doina Precup and Yee Whye Teh, editors, Proceedings of the 34th International Conference on Machine Learning (ICML 2017), volume 70 of Proceedings of Machine Learning Research, pages 2979–2987, 2017.
[73] Marcus Schaefer. Complexity of Some Geometric and Topological Problems. In David Eppstein and Emden R. Gansner, editors, GD 2009: Graph Drawing, volume 5849 of Lecture Notes in Computer Science, pages 334-344, 2010. doi:10.1007/978-3-642-11805-0_32.
[74] Marcus Schaefer. Realizability of Graphs and Linkages, pages 461-482. Thirty Essays on Geometric Graph Theory. Springer, 2013. doi:10.1007/978-1-4614-0110-0_24.
[75] Marcus Schaefer. Complexity of Geometric k-Planarity for Fixed k. Journal of Graph Algorithms and Applications, 25(1):29–41, 2021. doi:10.7155/jgaa.00548.
[76] Marcus Schaefer and Daniel Štefankovič. Fixed Points, Nash Equilibria, and the Existential Theory of the Reals. Theory of Computing Systems, 60:172-193, 2017. doi:10.1007/s00224-015-9662-0.
[77] Marcus Schaefer and Daniel Štefankovič. Beyond the Existential Theory of the Reals. arXiv preprint, 2022. arXiv:2210.00571.
[78] Marcus Schaefer and Daniel Šefankovič. The Complexity of Tensor Rank. Theory of Computing Systems, 62(5):1161-1174, 2018. doi:10.1007/s00224-017-9800-y.
[79] Thiago Serra, Christian Tjandraatmadja, and Srikumar Ramalingam. Bounding and Counting Linear Regions of Deep Neural Networks. In Jennifer Dy and Andreas Krause, editors, Proceedings of the 35th International Conference on Machine Learning (ICML 2018), volume 80 of Proceedings of Machine Learning Research, pages 4558-4566, 2018.
[80] Shai Shalev-Shwartz and Shai Ben-David. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, 2014. doi:10.1017/CB09781107298019.
[81] Yaroslav Shitov. A Universality Theorem for Nonnegative Matrix Factorizations. arXiv preprint, 2016. arXiv:1606.09068.
[82] Yaroslav Shitov. The complexity of positive semidefinite matrix factorization. SIAM Journal on Optimization, 27(3):1898-1909, 2017. doi:10.1137/16M1080616.
[83] Peter W. Shor. Stretchability of Pseudolines is NP-Hard. In Peter Gritzmann and Bernd Sturmfels, editors, Applied Geometry And Discrete Mathematics, volume 4 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 531-554, 1991. doi: 10.1090/dimacs/004/41.
[84] Jack Stade. Complexity of the Boundary-Guarding Art Gallery Problem. arXiv preprint, 2022. arXiv:2210.12817.
[85] Matus Telgarsky. Representation Benefits of Deep Feedforward Networks. arXiv preprint, 2015. arXiv:1509.08101.
[86] Matus Telgarsky. Benefits of depth in 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 1517-1539, 2016.
[87] Leslie G. Valiant. A Theory of the Learnable. Communications of the ACM, 27(11):1134-1142, 1984. doi:10.1145/1968.1972.
[88] Gal Vardi, Gilad Yehudai, and Ohad Shamir. On the Optimal Memorization Power of ReLU Neural Networks. In International Conference on Learning Representations (ICLR 2022), 2022.
[89] Dmitry Yarotsky. Error bounds for approximations with deep ReLU networks. Neural Networks, 94:103-114, 2017. doi:10.1016/j.neunet.2017.07.002.