18 citations · 100 across the 22 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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…
cs.LO2021
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics
Eric Alsmann, Florian Bruse, Martin Lange
We investigate the expressive power of the two main kinds of program logics for complex, non-regular program properties found in the literature: those extending propositional dynam…