Hertrich, C., Basu, A., Summa, M. D., and Skutella, M. Towards lower bounds on the depth of relu neural networks. In Ranzato, M., Beygelzimer, A., Dauphin, Y. N., Liang, P., and Vaughan, J. W. (eds.), Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual, pp. 3336-3348, 2021. URL https://proceedings.neurips.cc/paper/2021/bit/1b9812b99fe2672af746cefda86be5f9-Abstract.html.
Kannan, R. Minkowski's convex body theorem and integer programming. Math. Oper. Res., 12(3): 415-440, 1987.
Kozlov, M. K., Tarasov, S. P., and Khachiyan, L. G. Polynomial solvability of convex quadratic programming. In Doklady Akademii Nauk, volume 248, pp. 1049-1051. Russian Academy of Sciences, 1979.
Lenstra, H. W. and Jr. Integer programming with a fixed number of variables. Math. Oper. Res., 8(4): 538-548, 1983.
Maass, W. Bounds for the computational power and learning complexity of analog neural nets. SIAM J. Comput., 26(3):708-732, 1997. doi: 10.1137/S0097539793256041. URL https://doi.org/10.1137/S0097539793256041.
Megiddo, N. On the complexity of polyhedral separability. Discret. Comput. Geom., 3:325-337, 1988. doi: 10.1007/BF02187916. URL https://doi.org/10.1007/BF02187916.
Ordyniak, S. and Szeider, S. Parameterized complexity results for exact bayesian network structure learning. J. Artif. Intell. Res., 46:263-302, 2013. doi: 10.1613/jair.3744. URL https://doi.org/10.1613/jair.3744.
Pang, J.-S. Methods for quadratic programming: A survey. Computers & Chemical Engineering, 7 (5):583-594, 1983.
Panigrahi, A., Shetty, A., and Goyal, N. Effect of activation functions on the training of overparametrized neural nets. In 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020. OpenReview.net, 2020. URL https://openreview.net/forum?id=rkgfdeBYvH.
Robertson, N. and Seymour, P. D. Graph minors. i. excluding a forest. J. Comb. Theory, Ser. B, 35(1): 39-61, 1983.
Schaefer, T. J. The complexity of satisfiability problems. In Lipton, R. J., Burkhard, W. A., Savitch, W. J., Friedman, E. P., and Aho, A. V. (eds.), Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA, pp. 216-226. ACM, 1978. doi: 10.1145/800133.804350. URL https://doi.org/10.1145/800133.804350.
Simonov, K., Fomin, F. V., Golovach, P. A., and Panolan, F. Refined complexity of PCA with outliers. In Chaudhuri, K. and Salakhutdinov, R. (eds.), Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA, volume 97 of Proceedings of Machine Learning Research, pp. 5818-5826. PMLR, 2019. URL http://proceedings.mlr.press/v97/simonov19a.html.
Tarski, A. A Decision Method for Elementary Algebra and Geometry: Prepared for Publication with the Assistance of J.C.C. McKinsey. RAND Corporation, Santa Monica, CA, 1951.
Telgarsky, M. benefits of depth in neural networks. In Feldman, V., Rakhlin, A., and Shamir, O. (eds.), Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016, volume 49 of JMLR Workshop and Conference Proceedings, pp. 1517-1539. JMLR.org, 2016. URL http://proceedings.mlr.press/v49/telgarsky16.html.
Velu, R. and Reinsel, G. C. Multivariate reduced-rank regression: theory and applications, volume 136. Springer Science & Business Media, 2013.