Application of lattice theory for minimization of Boolean functions: Algorithms for constructing reduced DNFS of Boolean functions - Couverture souple

Timoshkin, Andrei

 
9786200567581: Application of lattice theory for minimization of Boolean functions: Algorithms for constructing reduced DNFS of Boolean functions

Synopsis

Last years an approach of solving the problem of minimization, based on the Notions of Partial Order theory, is developed. In this book two algorithms that find the reduced disjunctive normal form (DNF) of an arbitrary Boolean function and of an arbitrary order-convex Boolean function are presented. These algorithms use such notions of Partial Order theory as ideal and coideal and have essentially less time complexity than classical Quine and McCluskey’s algorithm.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.