Minimally invasive dentistry: History, theory and perspectives. In this regard,
minimally invasive methods are discussed, including air-abrasive, laser, sonic and ultrasonic
Randomization and nondeterminism are comparable for ordered read-onee branching programs© Springer-Verlag Berlin Heidelberg 1997. In [3] we exhibited a simple
boolean functions fn in n
Complexity of quantum uniform and nonuniform automata to proof technique used. We present explicit
Boolean functions that show that these lower bounds are tight
Reordering method and hierarchies for quantum and classical ordered binary decision diagrams of such functions. We present method (called “reordering”), which allows to build
Boolean function g from
Boolean Masking circuit faults and Trojan circuit injections using sat solvers guarantees correct circuit C behavior only on a set of
Boolean vectors applied during simulation. We suggest
Ортогонализация системы ДНФ булевых функций of technical systems, the representation of
Boolean functions in the form of disjunctive normal forms (DNF
Finding minimal polynomials of algebraic numbers of the form tan2(π/n) using Tschirnhausen’s transform transform. The first problem is connected with the construction of
minimal polynomials of the numbers
Параллельная декомпозиция системы частичных булевых функцийParallel decomposition of a system of partial
Boolean functions
О линейной разложимости двоичных функцийLinear decomposition of
boolean functions into a sum or a product of components