Return to Revisions

1 of 3

answered Oct 2, 2021 at 17:01

5.4k
1
15
25

This is the quadratic unconstrained binary optimization (QUBO) problem, which is NP-hard.

answered Oct 2, 2021 at 17:01

5.4k
1
15
25