✦ LIBER ✦

Average case quantum lower bounds for computing the Boolean mean

✍ Scribed by A. Papageorgiou

Book ID: 108163733
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 288 KB
Volume: 20
Category: Article
ISSN: 0885-064X
DOI: 10.1016/j.jco.2003.08.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average-Case Lower Bounds for Noisy Bool

Average-Case Lower Bounds for Noisy Boolean Decision Trees

✍ Evans, William; Pippenger, Nicholas 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 307 KB

Upper and lower bounds for the average-c

Upper and lower bounds for the average-case complexity of path-search

✍ Pippenger, Nicholas 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent

A lower bound for the volume-averaged me

A lower bound for the volume-averaged mean-square magnetostatic stray field

✍ A. Michels; J. Weissmüller; R. Birringer 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 427 KB

[Lecture Notes in Computer Science] ISA'

[Lecture Notes in Computer Science] ISA'91 Algorithms Volume 557 || A tight lower bound for the worst case of Bottom-Up-Heapsort

✍ Hsu, Wen-Lian; Lee, R. C. T. 📂 Article 📅 1991 🏛 Springer Berlin Heidelberg ⚖ 496 KB