Date: 2018-09-27 16:37:21Computational complexity theory Theoretical computer science Mathematical logic NP-complete problems Electronic design automation Formal methods Logic in computer science Predicate logic Boolean satisfiability problem Quantifier Limit of a function Exponential time hypothesis | | Delta-Decision Procedures for Exists-Forall Problems over the Reals Soonho Kong1 , Armando Solar-Lezama2 , and Sicun Gao3 1 Toyota Research InstituteAdd to Reading ListSource URL: scungao.github.ioDownload Document from Source Website File Size: 1,33 MBShare Document on Facebook
|