Login / Signup
A simple proof that AND-compression of NP-complete problems is hard.
Holger Dell
Published in:
CoRR (2014)
Keyphrases
</>
np complete problems
hard problems
np complete
neural network
image compression
genetic algorithm
reinforcement learning
search algorithm
graph coloring
random instances