471 citations · 1.3k across the 58 of their papers we have counts for
1 paper · 1 filter
Tad Hogg
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approx…