|
|
|
Publications in Math-Net.Ru |
Citations |
|
1979 |
| 1. |
S. N. Krachkovskii, V. A. Manevich, N. V. Petri, “On the Hausdorff representation of positive polynomials and convex approximations”, Dokl. Akad. Nauk SSSR, 246:4 (1979), 842–846    |
|
1969 |
| 2. |
N. V. Petri, “Complexity of algorithms and their operation time”, Dokl. Akad. Nauk SSSR, 186:1 (1969), 30–31 |
1
|
| 3. |
N. V. Petri, “The algorithms which are connected with predicates and with Boolean functions”, Dokl. Akad. Nauk SSSR, 185:1 (1969), 37–39 |
1
|
| 4. |
M. I. Kanovitch, N. V. Petri, “Certain theorems on the complexity of normal algorithms and computations”, Dokl. Akad. Nauk SSSR, 184:6 (1969), 1275–1276 |
1
|
| 5. |
N. V. Petri, “Two theorems on the complexity of algorithms and computations”, Zap. Nauchn. Sem. LOMI, 16 (1969), 165–174 |
| 6. |
Kh. D. Ikramov, N. V. Petri, “Matching of vector and matrix norms”, Zh. Vychisl. Mat. Mat. Fiz., 9:5 (1969), 987–995 ; U.S.S.R. Comput. Math. Math. Phys., 9:5 (1969), 1–14 |
|
1968 |
| 7. |
N. V. Petri, Kh. D. Ikramov, “Extremal properties of some matrix norms”, Zh. Vychisl. Mat. Mat. Fiz., 8:4 (1968), 865–871 ; U.S.S.R. Comput. Math. Math. Phys., 8:4 (1968), 219–230 |
2
|
|
|
|
1974 |
| 8. |
A. G. Dragalin, N. M. Nagornyi, N. V. Petri, N. A. Shanin, “Andrei Andreevich Markov (on his seventieth birthday)”, Uspekhi Mat. Nauk, 29:6(180) (1974), 187–191 ; Russian Math. Surveys, 29:6 (1974), 171–175 |
2
|
| |
|
|
Contact us: