✦ LIBER ✦

Tight Bounds on Quantum Searching

✍ Scribed by Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 210 KB
Volume: 46
Category: Article
ISSN: 0015-8208
DOI: 10.1002/(sici)1521-3978(199806)46:4/5<493::aid-prop493>3.0.co;2-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Bounds on Parallel List Marking

✍ Sandeep N. Bhatt; Gianfranco Bilardi; Kieran T. Herley; Geppino Pucci; Abhiram R 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 432 KB

Tight Lower Bounds on the Size of Sweepi

Tight Lower Bounds on the Size of Sweeping Automata

✍ Hing Leung 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Tight bounds on the chromatic sum of a c

Tight bounds on the chromatic sum of a connected graph

✍ Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views

Tight Bound on Johnson's Algorithm for M

Tight Bound on Johnson's Algorithm for Maximum Satisfiability

✍ Jianer Chen; Donald K. Friesen; Hao Zheng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability problem. In contrast to the common belief for two decades that Johnson's Algorithm has performance ratio 1Â2, we show that the performance ratio is 2Â3 and that this bound is

Bin packing with discrete item sizes, pa

Bin packing with discrete item sizes, part II: Tight bounds on First Fit

✍ E. G. Coffman Jr.; D. S. Johnson; P. W. Shor; R. R. Weber 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB

⌰ n log k when k s o n and ⌰ n log n the bound for the continuous uni-. Ž . form case when k s ⍀ n .

Optimal Parametric Search on Graphs of B

Optimal Parametric Search on Graphs of Bounded Tree-Width

✍ David Fernández-Baca; Giora Slutzki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 339 KB

We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on planar graphs.