|
|
Publications in Math-Net.Ru
-
A lower bound on formula size of a ternary linear function
Diskretn. Anal. Issled. Oper., 20:4 (2013), 15–26
-
The computation complexity in the class of formulas
Diskretn. Anal. Issled. Oper., 19:3 (2012), 3–12
-
On mobile sets in the binary hypercube
Diskretn. Anal. Issled. Oper., 15:3 (2008), 11–21
-
Code-Generating Factorizations of the $n$-Dimensional Unit Cube and of Perfect Binary Codes
Probl. Peredachi Inf., 33:1 (1997), 64–74
-
Sergei Vsevolodovich Yablonskii (on his 70th birthday)
Sibirsk. Zh. Issled. Oper., 1:4 (1994), 3–6
-
A spectral approach to the comparison of objects that are characterized by a set of signs
Dokl. Akad. Nauk SSSR, 206:6 (1972), 1309–1312
-
Difficulties of minimization of Boolean functions on the basis of universal approaches
Dokl. Akad. Nauk SSSR, 171:1 (1966), 13–16
-
On the length of a cycle in an $n$-dimensional unit cube
Dokl. Akad. Nauk SSSR, 148:4 (1963), 753–756
-
Irreducible disjunctive normal forms for certain classes of truth functions
Dokl. Akad. Nauk SSSR, 142:2 (1962), 263–265
-
Comparison of the complexity of impasse d.n.f. and minimal d.n.f.
Dokl. Akad. Nauk SSSR, 137:1 (1961), 13–16
-
In memory of Elizaveta Antonovna Okolnishnikova
Sib. Èlektron. Mat. Izv., 8 (2011), 31–34
© , 2026