Title: On the problem of computational time and complexity of arithmetic functions
Abstract: The time and incremental complexity required to perform two-operand addition using logical circuitry are compared for nonredundant and minimally redundant encodings of the operands. The comparison is extended to multi-operand addition and two-operand multiplication.