Delta-Decision Procedures for Exists-Forall Problems over the Reals Soonho Kong1 , Armando Solar-Lezama2 , and Sicun Gao3 1 Toyota Research Institute

First Page		Document Content
Date: 2018-09-27 16:37:21 Computational 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 Institute Add to Reading List Source URL: scungao.github.io Download Document from Source Website File Size: 1,33 MB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document