Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability

Nathan Segerlind

Published in: CoRR (2007)

Keyphrases

lower bound
exponential size
objective function
upper bound
database systems
np hard
integer programming
lower and upper bounds
upper and lower bounds
max sat
quantifier elimination