𝔖 Bobbio Scriptorium

✦ LIBER ✦

Lower Bound on Expected Complexity of Depth-First Tree Search with Multiple Radii

✍ Scribed by Ahn, J.; Kiseon Kim

Book ID: 117888015
Publisher: IEEE
Year: 2012
Tongue: English
Weight: 180 KB
Volume: 16
Category: Article
ISSN: 1089-7798
DOI: 10.1109/lcomm.2012.050912.120676

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms meeting the lower bounds on t

Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFTs and their connection with practical algorithms

✍ Duhamel, P. 📂 Article 📅 1990 🏛 IEEE ⚖ 704 KB