Reachability is NP-complete even for the simplest neural networks (Q2695495)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability is NP-complete even for the simplest neural networks |
scientific article |
Statements
Reachability is NP-complete even for the simplest neural networks (English)
0 references
31 March 2023
0 references
machine learning
0 references
computational complexity
0 references
formal specification and verification
0 references
