scientific article; zbMATH DE number 4085015

From MaRDI portal
Publication:3814804





[For the entire collection see Zbl 0638.00034.] The authors propose a bit-serial boolean circuit for computing the sum of n k-bit integers, the muliplication of two k-bit integers, the partial sums of n k-bit integers and sorting of n k-bit integers. The circuit for the second problem has \(\theta\) (k) time complexity and the circuits for the other problems have \(\theta\) (log n)\(+\theta (k)\) time complexity.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3814804)