Constant Multiplication Based on Boolean MinimizationConstant Multiplication Based on
Boolean Minimization Minimization of Boolean functions in the class of orthogonal disjunctive normal forms Boolean function is suggested. The means of graph theory are used in the approach. Two methods to obtain
Минимизация булевых функций в классе ортогональных дизъюнктивных нормальных формMinimization of
Boolean functions in the class of orthogonal disjunctive normal forms
Boolean algebras realized by c.e. equivalence relationsBoolean algebras realized by c.e. equivalence relations
Low power race-free state assignment of asynchronous automata minimizing the switching activity of memory elements with
minimizing the number of memory elements and
minimization of their switching activity. The problem is reduced
Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras, the Turing degree 0(α)is a degree of autostability of some computable
Boolean algebra and is also a degree
Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras, the Turing degree 0(α) is a degree of autostability of some computable
Boolean algebra and is also a degree
Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras, the Turing degree 0(α) is a degree of autostability of some computable
Boolean algebra and is also a degree
Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras, the Turing degree 0(α)is a degree of autostability of some computable
Boolean algebra and is also a degree
Complete testing of programmable boolean matrices and signature analysisIt is shown the usage of binary counter as test generator for programmable
boolean matrix permits