𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Exact Quantum Query Complexity

✍ Scribed by Montanaro, Ashley; Jozsa, Richard; Mitchison, Graeme

Book ID
125348006
Publisher
Springer
Year
2013
Tongue
English
Weight
724 KB
Volume
71
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Exact Worst Case Query Complexity
On the Exact Worst Case Query Complexity of Planar Point Location
✍ Raimund Seidel; Udo Adamy πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 241 KB

What is the smallest constant c so that the planar point location queries can be Ž . Ž . answered in c log n q o log n steps i.e., point᎐line comparisons in the worst 2 Ž case? M. T. Goodrich, M. Orletsky, and K. Ramaiyer 1997, in ''Proc 8th ACM-Ž . . SIAM Symp on Discrete Algorithms SODA ,'' pp. 75