Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity.

Rahul Santhanam Richard Ryan Williams

Published in: SODA (2015)

Keyphrases

exhaustive search
quantified boolean formulas
computational complexity
search methods
dynamic programming
solution space
search space
decision procedures
lower bound
simulated annealing
optimal solution
decision problems
special case
np hard
boolean formula