Publications in Math-Net.Ru
-
On the Hausdorff representation of positive polynomials and convex approximations
Dokl. Akad. Nauk SSSR, 246:4 (1979), 842–846
-
Complexity of algorithms and their operation time
Dokl. Akad. Nauk SSSR, 186:1 (1969), 30–31
-
The algorithms which are connected with predicates and with Boolean functions
Dokl. Akad. Nauk SSSR, 185:1 (1969), 37–39
-
Certain theorems on the complexity of normal algorithms and computations
Dokl. Akad. Nauk SSSR, 184:6 (1969), 1275–1276
-
Two theorems on the complexity of algorithms and computations
Zap. Nauchn. Sem. LOMI, 16 (1969), 165–174
-
Matching of vector and matrix norms
Zh. Vychisl. Mat. Mat. Fiz., 9:5 (1969), 987–995
-
Extremal properties of some matrix norms
Zh. Vychisl. Mat. Mat. Fiz., 8:4 (1968), 865–871
-
Andrei Andreevich Markov (on his seventieth birthday)
Uspekhi Mat. Nauk, 29:6(180) (1974), 187–191
© , 2026