1 paper · 1 filter
Máté Tibor Veszeli, Gábor Vattay
The Quadratic Unconstrained Binary Optimization (QUBO) problems are NP hard; thus, so far, there are no algorithms to solve them efficiently. There are exact methods like the Branc…