- Published 2010 in ArXiv
DOI:10.1088/1742-5468/2011/03/P03023

We study the adversarial satisfiability problem, where the adversary can choose whether variables are negated in clauses or not in order to make the resulting formula unsatisfiable. This is one case of a general class of adversarial optimization problems that often arise in practice and are algorithmically much harder than the standard optimization problems… CONTINUE READING

### Presentations referencing similar topics