Parallel addition time for several numbers (Q1866907)

The main result of the paper is as follows. Let \(k=2^r+1\), \(r\geq 1\). Then in the basis of functions of two variables of the \(k\)-valued logic one can construct a scheme \(S_{k,N}\) as \(N\to\infty\) which carries out the \((N,2)\)-transform for the time \[ D(S_{k,N})\leq \frac{1}{1-\log_2\alpha} \log_2N\cdot(1+o(1)), \] where \(\alpha\) is the largest modulus of the roots of the polynomial \(x^{r+1}-x^r-1\).