19 citations · 20 across the 2 of their papers we have counts for
2 papers
cs.AI2017★ 1 cited
Existence versus Exploitation: The Opacity of Backbones and Backdoors Under a Weak Assumption
Lane A. Hemaspaandra, David E. Narváez
Backdoors and backbones of Boolean formulas are hidden structural properties. A natural goal, already in part realized, is that solver algorithms seek to obtain substantially bette…
cs.CC2012★ 19 cited
An Atypical Survey of Typical-Case Heuristic Algorithms
Lane A. Hemaspaandra, Ryan Williams
Heuristic approaches often do so well that they seem to pretty much always give the right answer. How close can heuristic algorithms get to always giving the right answer, without…