Publications in Math-Net.Ru
-
On development of selftesting $1/n$-testers
Avtomat. i Telemekh., 1989, no. 1, 175–177
-
On a way то design easily tested circuits
Avtomat. i Telemekh., 1987, no. 7, 136–139
-
Complexity of tests of activity for partial Boolean functions
Avtomat. i Telemekh., 1986, no. 7, 118–124
-
Arithmetic complexity of provability predicate logics and their
fragments
Dokl. Akad. Nauk SSSR, 288:1 (1986), 11–14
-
On periodicity in Hermitian theories
Uspekhi Mat. Nauk, 33:2(200) (1978), 185–186
© , 2024