Skip to main content
SpringerLink
Log in

New algorithms for minimizing weakly defined Boolean functions

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. A. D. Zakrevskii, “Minimization algorithms for weakly defined Boolean functions,” Kibernetika [Cybernetics], no. 2, Kiev, 1965.

  2. A. D. Zakrevskii, “Computations in Boolean spaces,” in: The Logical Structure of Scientific Knowledge [in Russian], Nauka, Moscow, 1965.

    Google Scholar 

  3. Collection: A Logical Language for Writing Algorithms for Relay Circuit Synthesis,” ed. M. A. Gavrilov [in Russian], Izd-vo Nauka, Moscow, 1966.

    Google Scholar 

Download references

Authors
  1. A. D. Zakrevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Siberian Physicotechnical Institute, Tomsk. Translated from Kibernetika, Vol. 5, No. 5, pp. 21–28, September–October, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zakrevskii, A.D. New algorithms for minimizing weakly defined Boolean functions. Cybern Syst Anal 5, 553–560 (1969). https://doi.org/10.1007/BF01267876

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation