Date: 2014-07-21 06:41:07Theoretical computer science Mathematics Computational complexity theory Logic in computer science NP-complete problems Electronic design automation Formal methods Constraint programming Satisfiability modulo theories Boolean satisfiability problem Solver Automated reasoning | | Outline SMT: Where Do We Go From Here? Clark Barrett, New York University SMT Workshop, July 17, 2014Add to Reading ListSource URL: smt2014.it.uu.seDownload Document from Source Website File Size: 507,51 KBShare Document on Facebook
|