Steepest ascent can be exponential in bounded treewidth problems.

David A. Cohen Martin C. Cooper Artem Kaznatcheev Mark Wallace

Published in: CoRR (2019)

Keyphrases

np complete
bounded treewidth
highly parallelizable
steepest ascent
decision problems
optimization problems
parameterized complexity
database
databases
search space
simulated annealing
incomplete information