✦ LIBER ✦

Improved direct product theorems for randomized query complexity

✍ Scribed by Drucker, Andrew

Book ID: 113014822
Publisher: Springer
Year: 2012
Tongue: English
Weight: 491 KB
Volume: 21
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-012-0043-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong Direct Product Theorems for Quant

Strong Direct Product Theorems for Quantum Communication and Query Complexity

✍ Sherstov, Alexander A. 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 475 KB

A strong direct product theorem for quan

A strong direct product theorem for quantum query complexity

✍ Troy Lee, Jérémie Roland 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 366 KB

Lower Bounds for Randomized and Quantum

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

✍ Laplante, Sophie; Magniez, Frédéric 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 260 KB

New Direct-Product Testers and 2-Query P

New Direct-Product Testers and 2-Query PCPs

✍ Impagliazzo, Russell; Kabanets, Valentine; Wigderson, Avi 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 573 KB

Uniform Direct Product Theorems: Simplif

Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized

✍ Impagliazzo, Russell; Jaiswal, Ragesh; Kabanets, Valentine; Wigderson, Avi 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 400 KB

The Intersection Theorem for Direct Prod

The Intersection Theorem for Direct Products

✍ R. Ahlswede; H. Aydinian; L.H. Khachatrian 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 196 KB