|
|
Publications in Math-Net.Ru
-
Analysis of Efficiency of Universal Coding as a Function of the Block Length
Probl. Peredachi Inf., 20:2 (1984), 105–110
-
Construction of eigenvectors of completely continuous selfadjoint linear operators in constructive analysis for an eigenvalue of given multiplicity
Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 7, 86–88
-
Eigenvectors of completely continuous linear operators in constructive analysis
Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 6, 84–86
-
On the problem of eigenvectors of linear operators in constructive analysis
Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 5, 83–85
-
Bounds on the complexity of normal algorithms
Dokl. Akad. Nauk SSSR, 244:5 (1979), 1097–1101
-
On estimates of the complexity of algorithmic problems in constructive analysis
Dokl. Akad. Nauk SSSR, 233:6 (1977), 1064–1067
-
Traceable operators in constructive analysis
Dokl. Akad. Nauk SSSR, 230:4 (1976), 795–798
-
Constructive sets with an equality and their mappings
Trudy Mat. Inst. Steklov., 113 (1970), 173–259
-
Total constructive sets with equalities and some their properties
Zap. Nauchn. Sem. LOMI, 8 (1968), 272–280
-
Constructive sets with equality and their mappings
Dokl. Akad. Nauk SSSR, 173:1 (1967), 54–57
-
Non-trivial constructive mappings of certain sets
Dokl. Akad. Nauk SSSR, 168:1 (1966), 40–42
© , 2024