Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds

Rahul Santhanam. Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds. Bulletin of the EATCS, 106:31-52, 2012. [doi]

Abstract

Abstract is missing.