The Computational Complexity of Counting Linear Regions in ReLU Neural Networks

arXiv:2505.16716 · cs.CC, cs.DM, cs.LG, cs.NE, math.CO · Submitted 2025-05-22 · Read on arXiv

cs.CC, cs.DM, cs.LG, cs.NE, math.CO

Submitted: 2025-05-22

Updated: 2026-10-19

Comments: 23 pages, 6 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Papers — 1× in this paper · explained in 3 episodes

Related papers

• Parameterized Hardness of Zonotope Containment and Neural Network Verification
• Optimal Unambiguous DNFs and Alon-Saks-Seymour
• On the Limits of Quantum Multiparty Simultaneous Communication
• Learning, Compression, and Meta-Complexity
• Hardware-Algorithm Co-Optimization of Early-Exit Neural Networks for Multi-Core Edge Accelerators
• Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM