Research map / Learning theory and algorithms / Combinatorial and search optimization
Training Fully Connected Neural Networks is $\exists\mathbb{R}$-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 Neural Networks is ER-complete (NeurIPS 2021 · similarity 0.91)
- New Complexity-Theoretic Frontiers of Tractability for Neural Network Training (NeurIPS 2023 · similarity 0.89)
- Training Neural Networks is NP-Hard in Fixed Dimension (NeurIPS 2023 · similarity 0.89)
- On the Complexity of Learning Neural Networks (NeurIPS 2017 · similarity 0.88)
- On the Hardness of Training Deep Neural Networks Discretely (AAAI 2025 · similarity 0.87)
- Depth-Bounds for Neural Networks via the Braid Arrangement (NeurIPS 2025 · similarity 0.86)
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.