Reachability is NP-Complete Even for the Simplest Neural Networks.
Marco SälzerMartin LangePublished in: RP (2021)
Keyphrases
- np complete
- neural network
- randomly generated
- np hard
- computational complexity
- satisfiability problem
- pattern recognition
- constraint satisfaction problems
- artificial neural networks
- bounded treewidth
- data complexity
- genetic algorithm
- conjunctive queries
- multi layer
- fuzzy logic
- phase transition
- polynomial time complexity
- np complete problems
- neural nets
- recurrent neural networks
- state space
- pspace complete
- database
- neural network model
- self organizing maps
- back propagation
- special case
- machine learning
- computationally complex
- feed forward
- learning rules
- training process
- associative memory
- databases