Complexity of reachability problems in neural networks

DOI10.1007/978-3-031-45286-4_2MaRDI QIDQ6623010

Adrian Wurm

Publication date: 23 October 2024

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Tractability in constraint satisfaction problems: a survey
• Fixed points, Nash equilibria, and the existential theory of the reals
• A new polynomial-time algorithm for linear programming
• A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability
• Reluplex: an efficient SMT solver for verifying deep neural networks
• Reachability is NP-complete even for the simplest neural networks
• Essential Convexity and Complexity of Semi-Algebraic Constraints
• Classification-based financial markets prediction using deep neural networks
• Deep Learning Architectures
• Classifying the Complexity of Constraints Using Finite Algebras

This page was built for publication: Complexity of reachability problems in neural networks