|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
V. Solovyev, V. Ivanov, M. Solnyshkina, “Readability formulas for three levels of Russian school textbooks”, Zap. Nauchn. Sem. POMI, 529 (2023), 140–156 ; J. Math. Sci. (N. Y.), 285:1 (2024), 100–111 |
3
|
| 2. |
V. V. Bochkarev, V. D. Solovyev, T. A. Nestik, A. V. Shevlyakova, “Variations in average word valence of Russian books over a century and social change”, Zap. Nauchn. Sem. POMI, 529 (2023), 24–42 ; J. Math. Sci. (N. Y.), 285:1 (2024), 14–27 |
2
|
|
2016 |
| 3. |
I. S. Alimova, V. D. Solovyev, I. Z. Batyrshin, “Comparative analysis of the similarity measures based on the moving approximation transformation in problems of time series classification”, Proceedings of ISP RAS, 28:6 (2016), 207–222 |
1
|
|
2009 |
| 4. |
V. D. Solovyev, R. F. Fashutdinov, “Transformation of metrics used in clusterization methods for building the phylogenetic language trees”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:3 (2009), 229–239 |
|
2005 |
| 5. |
V. D. Solov'ev, “Проект “Электронная библиотека книг XVIII века” – первый этап”, Issled. Inform., 9 (2005), 117–124 |
|
2004 |
| 6. |
V. D. Solov'ev, “Один подход к классификации текстов на основе нейронных сетей”, Issled. Inform., 7 (2004), 21–28 |
|
2002 |
| 7. |
V. D. Solov'ev, G. A. Nikolaev, “Электронная коллекция древних книг и рукописей”, Issled. Inform., 4 (2002), 21–26 |
2
|
|
2000 |
| 8. |
V. D. Solov'ev, “Применима ли нечеткая логика к описанию структуры языка?”, Issled. Inform., 2 (2000), 55–62 |
|
1999 |
| 9. |
V. D. Solov'ev, “К построению метаязыка описания семантики”, Issled. Inform., 1 (1999), 75–84 |
|
1998 |
| 10. |
V. D. Solov'ev, “The completeness problem in the class of polynomials is decidable”, Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 8, 56–59 ; Russian Math. (Iz. VUZ), 42:8 (1998), 53–56 |
|
1997 |
| 11. |
V. D. Solov'ev, “Initial segments of effectively finite orders”, Mat. Zametki, 61:6 (1997), 950–953 ; Math. Notes, 61:6 (1997), 793–795 |
2
|
|
1996 |
| 12. |
V. D. Solov'ev, “The structure of information distribution in an infinite sequence”, Diskr. Mat., 8:2 (1996), 97–107 ; Discrete Math. Appl., 6:3 (1996), 285–294 |
4
|
| 13. |
V. D. Solov'ev, “Program algebras of recursive functions”, Uspekhi Mat. Nauk, 51:4(310) (1996), 125–144 ; Russian Math. Surveys, 51:4 (1996), 705–722 |
|
1995 |
| 14. |
V. D. Solov'ev, “On a family of precomplete classes of recursive functions and predicates”, Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 8, 57–62 ; Russian Math. (Iz. VUZ), 39:8 (1995), 54–59 |
|
1994 |
| 15. |
V. D. Solov'ev, “Computability by nondeterministic program and the Moschovakis search computability”, Mat. Zametki, 56:1 (1994), 149–152 ; Math. Notes, 56:1 (1994), 756–758 |
1
|
|
1993 |
| 16. |
V. D. Solov'ev, “Program-closed classes of general recursive functions and predicates of finite rank”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 9, 45–60 ; Russian Math. (Iz. VUZ), 37:9 (1993), 44–60 |
1
|
| 17. |
V. D. Solov'ev, “The structure of program-closed classes of multiplace functions and predicates”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 7, 47–50 ; Russian Math. (Iz. VUZ), 37:7 (1993), 46–49 |
| 18. |
V. D. Solov'ev, “The completeness problem in algebras of recursive functions with supplementary means of closure”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 6, 46–52 ; Russian Math. (Iz. VUZ), 37:6 (1993), 43–50 |
1
|
|
1990 |
| 19. |
V. D. Solov'ev, “Closed classes in $k$-valued logic with an operation of branching by predicates”, Diskr. Mat., 2:4 (1990), 18–25 |
6
|
|
1989 |
| 20. |
V. D. Solov'ev, “Completeness of systems of recursive functions and predicates. II”, Izv. Vyssh. Uchebn. Zaved. Mat., 1989, no. 9, 60–66 ; Soviet Math. (Iz. VUZ), 33:9 (1989), 60–64 |
1
|
| 21. |
V. D. Solov'ev, “Completeness of systems of recursive functions and predicates. I”, Izv. Vyssh. Uchebn. Zaved. Mat., 1989, no. 8, 56–63 ; Soviet Math. (Iz. VUZ), 33:8 (1989), 76–87 |
1
|
|
1982 |
| 22. |
V. D. Solov'ev, “The structure of closed classes of computable functions and predicates”, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 12, 51–56 ; Soviet Math. (Iz. VUZ), 26:12 (1982), 53–60 |
2
|
|
1977 |
| 23. |
M. M. Arslanov, R. F. Nadyrov, V. D. Solov'ev, “A criterion for the completeness of recursively enumerable sets, and some generalizations of a fixed point theorem”, Izv. Vyssh. Uchebn. Zaved. Mat., 1977, no. 4, 3–7 |
2
|
|
1976 |
| 24. |
V. D. Solov'ev, “Some generalizations of the notions of reducibility and creativity”, Izv. Vyssh. Uchebn. Zaved. Mat., 1976, no. 3, 65–72 ; Soviet Math. (Iz. VUZ), 20:3 (1976), 56–62 |
1
|
| 25. |
V. D. Solov'ev, “Superhypersimple sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 1976, no. 2, 108–110 ; Soviet Math. (Iz. VUZ), 20:2 (1976), 101–103 |
|
|
|
2021 |
| 26. |
B. M. Velichkovsky, B. A. Kobrinskii, V. D. Solov'ev, “Cognitive science and artificial intelligence: interpenetration and relative autonomy of these interdisciplinary areas in the nomenclature of the Higher attestation commission”, Artificial Intelligence and Decision Making, 2021, no. 4, 99–102 |
|
| Organisations |
|
| |
|
|