On possibility of refining bounds for the delay of a parallel adder |
| |
Authors: | V. M. Khrapchenko |
| |
Affiliation: | (1) Keldysh Institute of Applied Mathematics, Miusskaya pl. 4, Moscow, 125047, Russia |
| |
Abstract: | ![]() A nontrivial lower bound to the delay of a parallel adder over the classical basis B0 = {&; V, ?} is obtained with the additive remainder term of order log log log n. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|