✦ LIBER ✦

Space Complexity Vs. Query Complexity

✍ Scribed by Oded Lachish; Ilan Newman; Asaf Shapira

Book ID: 105768068
Publisher: Springer
Year: 2008
Tongue: English
Weight: 310 KB
Volume: 17
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-008-0239-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nonadaptive quantum query complexity

✍ Ashley Montanaro 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 136 KB

The query complexity of order-finding

✍ Richard Cleve 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Small PCPs with low query complexity

✍ P. Harsha; M. Sudan 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 606 KB

Query complexity of membership comparabl

Query complexity of membership comparable sets

✍ Till Tantau 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 217 KB

This paper investigates how many queries to k-membership comparable sets are needed in order to decide all (k + 1)-membership comparable sets. For k ¿ 2 this query complexity is at least linear and at most cubic. As a corollary, we obtain that more languages are O(log n)-membership comparable than t

Short PCPs with Polylog Query Complexity

✍ Ben-Sasson, Eli; Sudan, Madhu 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 626 KB

The quantum query complexity of the dete

The quantum query complexity of the determinant

✍ Sebastian Dörn; Thomas Thierauf 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 138 KB