No label defined (Q3814804)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4085015
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4085015

      Statements

      0 references
      0 references
      1988
      0 references
      bit complexity
      0 references
      parallel computations
      0 references
      boolean circuit
      0 references
      [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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references