DMCA

Nearly-exponential size lower bounds for symbolic quantifier elimination algorithms and OBDD-based proofs of unsatisfiability (2007)

Cached

Download Links

by Nathan Segerlind
Venue:Electronic Colloquium on Computational Complexity
Citations:6 - 1 self