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

	Practical improvements to class group and regulator computation of real quadratic fields Jean-Fran¸cois Biasse1 and Michael J. Jacobson, Jr.2? ´ Ecole Polytechnique, 91128 Palaiseau, France DocID: 1xT64 - View Document
	Human Computation:1:67-93 c 2014, Lasecki et al. CC-BY-3.0 ISSN: , DOI: hc.v1i1.5 Architecting Real-Time Crowd-Powered Systems DocID: 1vpyd - View Document
	Properness defects of projections and computation of one point in each connected component of a real algebraic set Mohab Safey El Din, LIP6, Universit´e Paris 6, France ´ DocID: 1uB8l - View Document
	The Continuous Stream Model of Computation for Real–Time Control Daniele Fontanelli, Luca Abeni, Luigi Palopoli Dipar?mento di Scienza e Ingegneria dell’Informazione DocID: 1u3BF - View Document
	PROGRAM EXTRACTION IN EXACT REAL ARITHMETIC KENJI MIYAMOTO AND HELMUT SCHWICHTENBERG Dedicated to John Tucker on occasion of his 60th birthday Abstract. The importance of an abstract approach to a computation theory over DocID: 1sX69 - View Document