Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds

  • Rahul Santhanam
  • Published 2012 in Electronic Colloquium on Computational Complexity

Abstract

I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP 6⊆ ACC, which proceeds via a new algorithm for ACC-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in the reverse direction, which have led to improved algorithms for k-SAT, Formula-SAT and AC-SAT, among other

Cite this paper

@article{Santhanam2012IronicCS, title={Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds}, author={Rahul Santhanam}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2012}, volume={19}, pages={84} }