Reachability is NP-Complete Even for the Simplest Neural Networks

Marco Sälzer, Martin Lange. Reachability is NP-Complete Even for the Simplest Neural Networks. In Paul C. Bell, Patrick Totzke, Igor Potapov, editors, Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings. Volume 13035 of Lecture Notes in Computer Science, pages 149-164, Springer, 2021. [doi]

Abstract

Abstract is missing.