Searching for "Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
by Sophie Laplante — 2004 — in Proc. of the 19th IEEE Conference on Computational Complexity
… LOWER BOUNDS FOR RANDOMIZED AND QUANTUM QUERY COMPLEXITY USING KOLMOGOROV ARGUMENTS ∗ SOPHIE LAPLANTE…
Cited by 25 (5 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB