Skip to main content
SpringerLink
Log in

The principle of raising the degree of indeterminacy of Boolean functions, and an algorithm for determining shortest disjunctive normal forms

  • 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

References

  1. Yu. I. Zhuravlev, “Set-theoretic methods in logical algebra,” in: Problems of Cybernetics [in Russian], No. 8, Moscow, 1962.

  2. Yu. I. Zhuravlev, “Estimates for the complexity of algorithms for constructing minimal disjunctive normal forms for the functions of logical algebra,” in: Discrete Analysis [in Russian], No. 3, SO AN SSSR, Novosibirsk, 1964.

    Google Scholar 

  3. Yu. N. Kornev, “Shortened disjunctive normal forms for partially defined Boolean functions,” Kibernetika [Cybernetics], no. 1, Kiev, 1966 [sic].

Download references

Authors
  1. Yu. N. Kornev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 3, No. 4, pp. 9–16, 1967

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kornev, Y.N. The principle of raising the degree of indeterminacy of Boolean functions, and an algorithm for determining shortest disjunctive normal forms. Cybern Syst Anal 3, 7–13 (1967). https://doi.org/10.1007/BF01071700

Download citation

  • Issue Date:

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

Keywords

Search

Navigation