Research map / Learning theory and algorithms / Combinatorial and search optimization
Training Neural Networks is ER-complete
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete (NeurIPS 2023 · similarity 0.91)
- Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions (AAAI 2024 · similarity 0.87)
- Training Neural Networks is NP-Hard in Fixed Dimension (NeurIPS 2023 · similarity 0.87)
- On the Hardness of Training Deep Neural Networks Discretely (AAAI 2025 · similarity 0.85)
- Taming Binarized Neural Networks and Mixed-Integer Programs (AAAI 2024 · similarity 0.83)
- Identifiability of Deep Polynomial Neural Networks (NeurIPS 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.