002-061_Papers_untitled_01

First Page		Document Content
Date: 2018-06-25 09:59:57 Theoretical computer science Mathematics Logic in computer science Constraint programming Formal methods Electronic design automation NP-complete problems Satisfiability modulo theories Expression Algorithm Concolic testing Program synthesis		002-061_Papers_untitled_01 Add to Reading List Source URL: rishabhmit.bitbucket.io Download Document from Source Website File Size: 298,69 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