The Complexity of ReLU Network Synthesis from a Parameter Multiset
cs.CC, cs.LG
Submitted: 2026-11-02
Updated: 2026-11-04
Terminology
Sources
- Estimates of Some Functions Over Primes without R.H.
- Computational Math with Neural Networks is Hard
- The Symmetries of Three-Layer ReLU Networks
- Propositional formula minimization is 2 p-complete under many-one reductions
- Probabilistic Linear Explanations
- NP-Hardness of Minimizing Neurons in Two-Hidden-Layer ReLU Neural Networks
- Probabilistic ML Verification via Weighted Model Integration
- Robustness Verification in Neural Networks
- Security Properties of Neural Networks as Decision Problems
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?