Motivation (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation

First Page		Document Content
Date: 2010-03-02 07:15:36 Science Stephen Smale Computational complexity theory Blum–Shub–Smale machine Theory of computation Real algebraic geometry Hypercomputation Real computation Mathematics Theoretical computer science Algebraic geometry		Motivation (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Add to Reading List Source URL: www.math.purdue.edu Download Document from Source Website File Size: 852,02 KB Share Document on Facebook

	Motivation (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation DocID: 5ARc - View Document
	(Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Algorithmic Semi-algebraic Geometry DocID: 5oWJ - View Document
	(Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Algorithmic Semi-algebraic Geometry DocID: 5nPK - View Document
	(Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation Algorithmic Semi-algebraic Geometry DocID: 56g3 - View Document