Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth.

Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlk

Browse the full SODA paper archive.