|
|
Publications in Math-Net.Ru
-
Thin circulant matrixes and lower bounds on complexity of some Boolean operators
Diskretn. Anal. Issled. Oper., 18:5 (2011), 38–53
-
Letter to the Editor
Diskretn. Anal. Issled. Oper., 15:4 (2008), 92–93
-
Уточнение верхней оценки глубины сумматора и компаратора
Diskretn. Anal. Issled. Oper., 15:2 (2008), 12–22
-
On the construction of schemes for adders of small depth
Diskretn. Anal. Issled. Oper., Ser. 1, 14:1 (2007), 27–44
-
On a search for the optimal order of variables in the synthesis of circuits by the cascade method
Diskretn. Anal. Issled. Oper., Ser. 1, 5:2 (1998), 28–39
-
On the complexity of the realization of Boolean functions in three classes of schemes in a basis consisting of all symmetric functions
Diskretn. Anal. Issled. Oper., 3:1 (1996), 3–8
-
On the complexity of relay contact networks realizing symmetric
Boolean functions
Dokl. Akad. Nauk SSSR, 309:4 (1989), 787–791
-
Complexity of the realization of cyclic Boolean matrices by gate circuits
Izv. Vyssh. Uchebn. Zaved. Mat., 1988, no. 7, 39–44
© , 2026