Reachability Is NP-Complete Even for the Simplest Neural Networks.

Marco Sälzer Martin Lange

Published in: CoRR (2021)

Keyphrases

np complete
neural network
randomly generated
np hard
satisfiability problem
pattern recognition
computational complexity
constraint satisfaction problems
fuzzy logic

phase transition
back propagation
genetic algorithm
pspace complete
fuzzy systems
state space
fault diagnosis
artificial neural networks

neural nets
np complete problems
polynomial time complexity
neural network is trained
associative memory
conjunctive queries
neural network model
upper bound

recurrent neural networks
training process
activation function
data complexity
transitive closure
radial basis function
special case
reinforcement learning