Application of lattice theory for minimization of Boolean functions - Timoshkin, Andrei
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
payback
11 °P sammeln
  • Broschiertes Buch

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 auch für
Produktbeschreibung
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.
Autorenporträt
Andrei Timoshkin graduated from Moscow Institute of Electronic Engineering in 1988. He received the Ph.D. degree from Saratov State University in1996 in field of mathematical cybernetics. He is presently an Assistant Professor of Applied Mathematics and Computer Technics at National Metallurgical Academy of Ukraine (Dnepr).