Generic hardness of the Boolean satisfiability problem.

Alexander N. Rybalov

Published in: Groups Complex. Cryptol. (2017)

Keyphrases

learning theory
phase transition
wide range
computational complexity
np complete
sat solvers
satisfiability problem
artificial neural networks
upper bound
np hardness
databases
sat problem
worst case
lower bound
reinforcement learning
social networks
artificial intelligence
machine learning
data mining