Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

57

Voted

CORR
2010
Springer

37views Education» more CORR 2010»

The Cardinality of an Oracle in Blum-Shub-Smale Computation

15 years 2 months ago

The Cardinality of an Oracle in Blum-Shub-Smale Computation

Download qcpages.qc.cuny.edu

Wesley Calvert, Ken Kramer, Russell Miller

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» From query complexity to computational complexity

» Supporting TimeConstrained SQL Queries in Oracle

» Submodular Approximation Samplingbased Algorithms and Lower Bounds

» Symmetry and Approximability of Submodular Maximization Problems

» Privacy preserving set intersection based on bilinear groups

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Wesley Calvert, Ken Kramer, Russell Miller

Comments (0)