Decomposition algorithms for solving NP-hard problems on a quantum annealer.

Elijah Pelofske Georg Hahn Hristo N. Djidjev

Published in: CoRR (2020)

Keyphrases

np hard problems
np hard
constraint programming
combinatorial search
orders of magnitude
state space
worst case
computational complexity
knapsack problem
depth first search