Skip to main content
SpringerLink
Log in

Remark on minimization of depth of Boolean circuits

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

It is shown that Lozhkin’s method (1981) for minimization of the depth of formulas with a bounded number of changing types of elements in paths from input to output and Hoover-Klawe-Pippenger’s method (technical report in 1981, journal publication in 1984) for minimization of the depth of circuits with unbounded branching by insertion of trees from buffers with bounded branching of outputs for each buffer are dual to each other and can be proved by one and the same method.

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

References

  1. H. J. Hoover, M. M. Klawe, and N. J. Pippenger, “Bounding Fan-Out in Logical Networks,” J. Assoc. Comp. Mach., 31,(4), 13 (1984).

    MATH  Google Scholar 

  2. S. A. Lozhkin, “A Connection Between Depth and Complexity of Equivalent Formulas, and Depth of Monotone Functions of the Algebra of Logic,” in Problemy Kibernetiki (Nauka, Moscow, 1981), Vol. 38, pp. 269–271.

    Google Scholar 

  3. O. B. Lupanov, “On Realization of Functions of the Algebra of Logic by Formulas from Finite Classes (Formulas of Bounded Depth) in the Basis &, ⋁, ⌝,” in Problemy Kibernetiki (Fizmatgiz, Moscow, 1961), Vol. 6, pp. 5–14.

    Google Scholar 

  4. S. B. Gashkov, “On Depth of Boolean Functions,” in Problemy Kibernetiki (Nauka, Moscow, 1978), Vol. 34, pp. 265–268.

    Google Scholar 

  5. O. B. Lupanov, Asymptotic Bounds for Complexity of Control Systems (Izd-vo MGU, Moscow, 1984) [in Russian].

    Google Scholar 

  6. S. V. Yablonskii, Introduction to Discrete Mathematics (Vysshaya Shkola, Moscow, 2001) [in Russian].

    Google Scholar 

  7. O. B. Lupanov, “A Class of Circuits of Functional Elements (Formulas with Partial Memory),” in Problemy Kibernetiki (Fizmatgiz, Moscow, 1962), Vol. 7, pp. 61–114.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Leninskie Gory, Moscow, 119991, Russia

    S. B. Gashkov

Authors
  1. S. B. Gashkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © S.B. Gashkov, 2007, published in Vestnik Moskovskogo Universiteta, Matematika, Mekhanika, 2007, Vol. 62, No. 3, pp. 7–9.

About this article

Cite this article

Gashkov, S.B. Remark on minimization of depth of Boolean circuits. Moscow Univ. Math. Bull. 62, 87–89 (2007). https://doi.org/10.3103/S0027132207030011

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132207030011

Keywords

Search

Navigation