52 citations · 146 across the 26 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Counting homomorphisms in plain exponential time
Amineh Dadsetan, Andrei A. Bulatov
In the counting Graph Homomorphism problem (#GraphHom) the question is: Given graphs G,H, find the number of homomorphisms from G to H. This problem is generally #P-complete, moreo…
cs.DS2008★ 5 cited
Phase transition for Local Search on planted SAT
Andrei A. Bulatov, Evgeny S. Skvortsov
The Local Search algorithm (or Hill Climbing, or Iterative Improvement) is one of the simplest heuristics to solve the Satisfiability and Max-Satisfiability problems. It is a part…