Sciweavers

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

90

Voted

CORR
2010
Springer

123views Education» more CORR 2010»

Improved Direct Product Theorems for Randomized Query Complexity

15 years 2 months ago

Improved Direct Product Theorems for Randomized Query Complexity

Download people.csail.mit.edu

Andrew Drucker

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» Strong direct product theorems for quantum communication and query complexity

» A Direct Product Theorem for Discrepancy

» Uniform Direct Product Theorems Simplified Optimized and Derandomized

» Constructive Proofs of Concentration Bounds

» New upper and lower bounds for randomized and quantum local search

» Boundederror quantum state identification and exponential separations in communication com...

» Lower bounds for adaptive linearity tests

» A genetic approach for random testing of database systems

» The Multiplicative Quantum Adversary

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Andrew Drucker

Comments (0)