Back to Results
First PageMeta Content
Theoretical computer science / Computational complexity theory / Mathematics / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Boolean algebra / Satisfiability modulo theories / Boolean satisfiability problem / Conflict-driven clause learning / Solver


A Tale Of Two Solvers: Eager and Lazy Approaches to Bit-vectors? Liana Hadarean1 , Kshitij Bansal1 , Dejan JovanoviĀ“c3 , Clark Barrett1 , and Cesare Tinelli2 1 2
Add to Reading List

Document Date: 2014-06-27 13:33:30


Open Document

File Size: 536,89 KB

Share Result on Facebook