RUS  ENG
Full version
JOURNALS // Itogi Nauki i Tekhniki. Seriya "Teoriya Veroyatnostei. Matematicheskaya Statistika. Teoreticheskaya Kibernetika" // Archive

Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 1987 Volume 25, Pages 68–116 (Mi intv68)

This article is cited in 13 papers

Boolean function minimization in the class of disjunctive normal forms

A. A. Sapozhenko, I. P. Chukhrov


Abstract: The survey focuses on minimization of boolean functions in the class of disjunctive normal forms (d.n.f.s) and covers the publications from 1953 to 1986. The main emphasis is on the mathematical direction of research in boolean function minimization: bounds of parameters of boolean functions and algorithmic difficulties of minimal d.n.f. synthesis). The survey also presents a classification of minimization algorithms and gives some examples of minimization heuristics with their efficiency bounds.

UDC: 519.714.7


 English version:
Journal of Soviet Mathematics, 1989, 46:4, 2021–2052

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024