Martin Lange
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1ML×1Logic×1
Frequent co-authors
Research Timeline
2026
The Complexity of Verifying Feedforward Neural Networks in Quantised Settings
This paper analyzes the computational complexity of verifying feedforward neural networks when their weights are restricted to finite-width arithmetic, finding that verification remains NP-complete for fixed-precision networks and establishing upper bounds for dynamically quantized networks.
Highlighted terms show continued research focus across papers