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

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi and Pavel Pudlak

Journal publisher: SIAM

Published year: 2018