Sciweavers

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

9

ECCC
2007

favoriteEmaildiscussreport

89views more ECCC 2007»

The black-box query complexity of polynomial summation

13 years 4 months ago

The black-box query complexity of polynomial summation

Download www.cs.technion.ac.il

Ali Juma, Valentine Kabanets, Charles Rackoff, Ami

Real-time Traffic

ECCC 2007 |

claim paper

Related Content

» On the BlackBox Complexity of Sperners Lemma

» The BlackBox Complexity of Nearest Neighbor Search

» Tight informationtheoretic lower bounds for welfare maximization in combinatorial auctions

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ECCC
Authors	Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka

Comments (0)