Sharpening an upper bound on the adder and comparator depths |
| |
Authors: | M I Grinchuk |
| |
Institution: | (1) Department of Mechanics and Mathematics, Moscow State University, Moscow, 119922, Russia |
| |
Abstract: | The upper bound log2 n + log2 log2 n + const is proved on the depth of the addition and comparison operators on n-bit numbers over the basis {&;, ∨, ~}. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|