Skip to main content
SpringerLink
Log in

Symbolic minimization of disjunctive normal forms

  • Decision Making and Optimization Theory
  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

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. Yu. I. Zhuravlev, "Algorithms to construct minimal disjunctive normal forms for Boolean functions," in: Discrete Mathematics and Mathematical Topics in Cybernetics [in Russian], Nauka, Moscow (1974).

    Google Scholar 

  2. B. Buchberger and J. Collins, Computer Algebra. Symbolic and Algebraic Computation [Russian translation], Mir, Moscow (1986).

    Google Scholar 

Download references

Authors
  1. M. V. Mikhailyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. G. Sedrakyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Programmnoe Obespechenie i Modeli Sistemnogo Analiza, pp. 30–37, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mikhailyuk, M.V., Sedrakyan, N.G. Symbolic minimization of disjunctive normal forms. Comput Math Model 4, 312–316 (1993). https://doi.org/10.1007/BF01128753

Download citation

  • Issue Date:

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

Keywords

Search

Navigation