Sciweavers

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

13

APPROX
2010
Springer

favoriteEmaildiscussreport

133views Algorithms» more APPROX 2010»

Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries

13 years 6 months ago

Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries

Download www.eng.tau.ac.il

Elya Dolev, Dana Ron

Real-time Traffic

Algorithms | APPROX 2010 |

claim paper

Related Content

» Quantum Query Complexity of Multilinear Identity Testing

» Proclaiming Dictators and Juntas or Testing Boolean Formulae

» Testing Computability by Width Two OBDDs

» Testing TriangleFreeness in General Graphs

Post Info
More Details (n/a)

Added	26 Oct 2010
Updated	26 Oct 2010
Type	Conference
Year	2010
Where	APPROX
Authors	Elya Dolev, Dana Ron

Comments (0)