Search Results for author:
Found 3 papers, 0 papers with code
Computational Social Choice and Computational Complexity: BFFs?
We discuss the connection between computational social choice (comsoc) and computational complexity.
Existence versus Exploitation: The Opacity of Backbones and Backdoors Under a Weak Assumption
For example, in this paper we show that, under the assumption that P $\neq$ NP, there are easily recognizable families of Boolean formulas with strong backdoors that are easy to find, yet for which it is hard (in fact, NP-complete) to determine whether the formulas are satisfiable.
The Opacity of Backbones
We show that, under the widely believed assumption that integer factoring is hard, there exist sets of boolean formulas that have obvious, nontrivial backbones yet finding the values, $a_S$, of those backbones is intractable.
