Login / Signup
Roughly Polynomial Time: A Concept of Tractability Covering All Known Natural NP-complete Problems.
Andras Farago
Published in:
CoRR (2016)
Keyphrases
</>
np complete problems
np complete
computational complexity
graph coloring
bounded treewidth
phase transition
learning algorithm
search algorithm
constraint satisfaction
search strategies
randomly generated
suboptimal solutions