Date: 2018-07-14 13:51:00Theoretical computer science NP-complete problems Logic in computer science Constraint programming Electronic design automation Formal methods Satisfiability modulo theories Solver Benchmark Unsatisfiable core Lis | | 13th International Satisfiability Modulo Theories Competition (SMT-COMP 2018): Rules and Procedures Matthias Heizmann University of Freiburg GermanyAdd to Reading ListSource URL: smtcomp.sourceforge.netDownload Document from Source Website File Size: 203,66 KBShare Document on Facebook
|