Skip to main content
SpringerLink
Log in

Bounds for parallel addition time of two numbers

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The depth of a Boolean circuit that computes the sum of two n-digit binary numbers is shown to increase faster than log n + O(1). A similar result is proved for a circuit that evaluates a polynomial of n-th degree.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature Cited

  1. V. M. Khrapchenko, "On an asymptotic bound for the addition time in a parallel adder," in: Problems of Cybernetics [in Russian], Nauka, Moscow (1967), pp. 107–122.

    Google Scholar 

  2. N. Pippenger, "The complexity of computations by networks," IBM J. Res. Develop.,31, No. 2, 235–243 (1987).

    Google Scholar 

  3. K. Maruyama, "On the parallel evaluation of polynomials," IEEE Trans. Comput.,22, No. 1, 2–5 (1973).

    Google Scholar 

  4. B. Commentz-Walter, "Size—depth tradeoff in monotone Boolean formulae," Acta Inform., No. 12, 227–243 (1979).

    Google Scholar 

Download references

Authors
  1. I. K. Rystsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 11–24, July–August, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rystsov, I.K. Bounds for parallel addition time of two numbers. Cybern Syst Anal 27, 481–491 (1991). https://doi.org/10.1007/BF01130356

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01130356

Keywords

Search

Navigation