Reachability is NP-complete even for the simplest neural networks (Q2695495)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7670978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability is NP-complete even for the simplest neural networks |
scientific article; zbMATH DE number 7670978 |
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
