𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

✍ Scribed by Laplante, Sophie; Magniez, Frédéric


Book ID
118180694
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
260 KB
Volume
38
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES