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

First Page		Document Content
Date: 2009-07-30 22:08:48 Structural complexity theory Algebraic geometry Blum–Shub–Smale machine Polynomial hierarchy NP Polynomial Prime number Stephen Smale 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: 790,92 KB Share Document on Facebook

	Aftermath February 2013 Volume 12, Number 2 Math for America Utah Hosts DocID: 1alFU - View Document
	December 2010 Volume 10, Number 2 University of Utah Department of Mathematics DocID: 1acfi - View Document
	Aftermath February 2014 Volume 13, Number 2 Inquiry in Mathematics DocID: 19hYF - View Document
	February 2003 Volume 3, Number 6 University of Utah Department of Mathematics DocID: 19bE1 - View Document
	Review: Der Lindberghflug DocID: 14JUq - View Document