(Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Algorithmic Semi-algebraic Geometry

First Page		Document Content
Date: 2009-07-30 22:06:02 Structural complexity theory Algebraic geometry Blum–Shub–Smale machine Polynomial hierarchy NP Polynomial Stephen Smale Prime number Algorithm Theoretical computer science Mathematics Applied mathematics		(Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Algorithmic Semi-algebraic Geometry Add to Reading List Source URL: www.math.purdue.edu Download Document from Source Website File Size: 934,61 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