𝔖 Bobbio Scriptorium

✦ LIBER ✦

An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order

✍ Scribed by Martin Sauerhoff

Book ID: 108112868
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 332 KB
Volume: 158
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.03.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 30th Annual Symposium on Foundatio

[IEEE 30th Annual Symposium on Foundations of Computer Science - Research Triangle Park, NC, USA (1989.10.30-1989.11.1)] 30th Annual Symposium on Foundations of Computer Science - An optimal lower bound on the number of variables for graph identification

✍ Cai, J.-Y.; Furer, M.; Immerman, N. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 571 KB