18 citations · 100 across the 22 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
Reachability In Simple Neural Networks
Marco Sälzer, Martin Lange
We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem…
cs.CC2021
Reachability Is NP-Complete Even for the Simplest Neural Networks
Marco Sälzer, Martin Lange
We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem…