most citedMonte Carlo Search for Very Hard KSAT Realizations for Use in Quantum Annealing

6 citations · 8 across the 2 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

1 paper · 1 filter

cond-mat.stat-mech2014★ 6 cited

Monte Carlo Search for Very Hard KSAT Realizations for Use in Quantum Annealing

Neuhaus Thomas

Using powerful Multicanonical Ensemble Monte Carlo methods from statistical physics we explore the realization space of random K satisfiability (KSAT) in search for computational h…