Bounded Verification with On-the-Fly Discrepancy Computation ? Chuchu Fan and Sayan Mitra {cfan10,mitras Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign. - University of Illinois at Urbana–Champaign - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-01-22 19:21:52 Circuit complexity NC Mathematics Theoretical computer science Numerical software Lemmas Numerical linear algebra		Bounded Verification with On-the-Fly Discrepancy Computation ? Chuchu Fan and Sayan Mitra {cfan10,mitras}@illinois.edu Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign. Add to Reading List Source URL: publish.illinois.edu Download Document from Source Website File Size: 344,84 KB 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