Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth.
Daniel LokshtanovIvan MikhailinRamamohan PaturiPavel PudlákPublished in: SODA (2018)
Keyphrases
- brute force
- bounded treewidth
- np complete
- conjunctive queries
- computational complexity
- highly parallelizable
- computationally expensive
- decision problems
- np hard
- exhaustive search
- decision procedures
- constraint satisfaction problems
- phase transition
- computer chess
- fixed parameter tractable
- polynomial size
- special case
- databases
- database