|
|
|
Publications in Math-Net.Ru |
Citations |
|
1993 |
| 1. |
G. F. Losev, “Classes of local algorithms for computing information”, Dokl. Akad. Nauk, 331:4 (1993), 413–415    ; Dokl. Math., 38:8 (1993), 326–328 |
|
1982 |
| 2. |
G. F. Losev, “Local algorithms for computing information and the problem of a minimal covering”, Dokl. Akad. Nauk SSSR, 267:3 (1982), 544–548 |
| 3. |
G. F. Losev, “Local algorithms for computing information with nonfixed memory”, Dokl. Akad. Nauk SSSR, 264:3 (1982), 547–550 |
|
1978 |
| 4. |
A. V. Kabulov, G. F. Losev, “Local algorithms for the simplification of disjunctive normal forms of Boolean functions”, Zh. Vychisl. Mat. Mat. Fiz., 18:3 (1978), 728–734 ; U.S.S.R. Comput. Math. Math. Phys., 18:3 (1978), 201–207 |
17
|
|
1974 |
| 5. |
G. F. Losev, “Conditionally majorant local algorithms with arbitrary memory for problems of the synthesis of minimal coverings”, Zh. Vychisl. Mat. Mat. Fiz., 14:3 (1974), 744–755 ; U.S.S.R. Comput. Math. Math. Phys., 14:3 (1974), 202–213 |
| 6. |
G. F. Losev, “The best local algorithm, for the construction of the sum of the disjunctive normal forms of a Boolean function, that uses neighborhoods of minimal order”, Zh. Vychisl. Mat. Mat. Fiz., 14:2 (1974), 470–478 ; U.S.S.R. Comput. Math. Math. Phys., 14:2 (1974), 193–201 |
|
1973 |
| 7. |
G. F. Losev, “The best local algorithm of index $1$ for the construction of the sum of the irredundant disjunctive normal forms of a Boolean function”, Dokl. Akad. Nauk SSSR, 212:4 (1973), 816–817 |
| 8. |
G. F. Losev, “On a test of M. Izumi and S. Izumi for the convergence of Fourier series”, Izv. Vyssh. Uchebn. Zaved. Mat., 1973, no. 5, 40–44 |
|
| Organisations |
|
| |
|
|
Contact us: