Application of lattice theory for minimization of Boolean functions
Algorithms for constructing reduced DNFS of Boolean functions
Versandfertig in 6-10 Tagen
22,99 €
inkl. MwSt.
PAYBACK Punkte
11 °P sammeln!
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.
Andere Kunden interessierten sich für
