Nathan Segerlind Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability http://arxiv.org/abs/cs/0701054 2007 CoRR abs/cs/0701054 db/journals/corr/corr0701.html#abs-cs-0701054 informal publication