Matrosov Viktor Leonidovich

Publications in Math-Net.Ru

1. The capacity of polynomial expansions of a set of algorithms for calculating estimates
   
   Zh. Vychisl. Mat. Mat. Fiz., 25:1 (1985),  122–133
2. Lower bounds of the capacity of $L$-dimensional algebras of estimate-computing algorithms
   
   Zh. Vychisl. Mat. Mat. Fiz., 24:12 (1984),  1881–1891
3. Capacity of algebraic extensions of a model of estimate-computing algorithms
   
   Zh. Vychisl. Mat. Mat. Fiz., 24:11 (1984),  1719–1730
4. On the incompleteness of a model of algorithms for computing estimates
   
   Zh. Vychisl. Mat. Mat. Fiz., 23:2 (1983),  453–466
5. Isomorphism of pairs of admissible objects in pattern recognition problems
   
   Zh. Vychisl. Mat. Mat. Fiz., 23:1 (1983),  178–183
6. Optimal algorithms in algebraic closures of evaluating operators
   
   Dokl. Akad. Nauk SSSR, 262:4 (1982),  818–822
7. On completeness criteria for a model of algorithms for computing estimates and its algebraic closures
   
   Dokl. Akad. Nauk SSSR, 258:4 (1981),  792–796
8. Complexity of computable functions for a generalized storage measure
   
   Mat. Zametki, 29:6 (1981),  895–905
9. Correct algebras of bounded capacity on the set of algorithms of the calculation of estimates
   
   Zh. Vychisl. Mat. Mat. Fiz., 21:5 (1981),  1276–1291
10. Correct algebras of bounded capacity over sets of incorrect algorithms
    
    Dokl. Akad. Nauk SSSR, 253:1 (1980),  25–30
11. Complexity of algorithms and computations
    
    Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 16 (1979),  103–149
12. Complexity classes and classes of computable signaling functions
    
    Dokl. Akad. Nauk SSSR, 226:3 (1976),  513–515