RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Andreev, Aleksandr Egorovich

Statistics Math-Net.Ru
Total publications: 21
Scientific articles: 21

Number of views:
This page:590
Abstract pages:2497
Full texts:973
References:113
Professor
Doctor of physico-mathematical sciences (1985)
Birth date: 13.07.1956
E-mail:

http://www.mathnet.ru/eng/person22858
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/190682

Publications in Math-Net.Ru
2009
1. V. B. Kudryavtsev, A. E. Andreev, “Test recognition”, Fundam. Prikl. Mat., 15:4 (2009),  67–99  mathnet  mathscinet; J. Math. Sci., 169:4 (2010), 457–480  scopus
2. V. B. Kudryavtsev, A. E. Andreev, “On algorithm complexity”, Fundam. Prikl. Mat., 15:3 (2009),  135–181  mathnet  mathscinet  elib; J. Math. Sci., 168:1 (2010), 89–122  scopus
1997
3. A. E. Andreev, A. A. Bolotov, “On linear hashing of binary sets”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1997, 2,  22–25  mathnet  mathscinet  zmath
1996
4. A. E. Andreev, A. A. Chasovskikh, “Automaton complexity of two-place Boolean bases”, Diskr. Mat., 8:4 (1996),  123–133  mathnet  mathscinet  zmath; Discrete Math. Appl., 6:6 (1996), 599–610
5. A. E. Andreev, I. A. Vikhlyantsev, “О сложности нумеpующих опеpатоpов”, Diskr. Mat., 8:4 (1996),  44–56  mathnet  mathscinet  zmath; Discrete Math. Appl., 6:6 (1996), 549–561
6. A. E. Andreev, A. A. Chasovskikh, “Complexity of automata that compute the values of formulas”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1996, 4,  22–24  mathnet  mathscinet  zmath
1995
7. A. E. Andreev, “On the completeness of gradient gate circuits”, Diskr. Mat., 7:1 (1995),  66–76  mathnet  mathscinet  zmath; Discrete Math. Appl., 5:1 (1995), 83–92
1994
8. A. E. Andreev, I. A. Vikhlyantsev, “Estimates for the length of a code for schemes consisting of functional elements”, Diskr. Mat., 6:4 (1994),  10–20  mathnet  mathscinet  zmath; Discrete Math. Appl., 4:6 (1994), 579–588
9. A. E. Andreev, “On a method for the synthesis of formulas”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1994, 6,  23–27  mathnet  mathscinet  zmath
1989
10. A. E. Andreev, “The complexity of realizing partial Boolean functions by schemes consisting of functional elements”, Diskr. Mat., 1:4 (1989),  36–45  mathnet  mathscinet  zmath; Discrete Math. Appl., 1:3 (1991), 251–261
1987
11. A. E. Andreev, “The complexity of the realization of subdefinite matrices by gate schemes”, Mat. Zametki, 41:1 (1987),  77–86  mathnet  mathscinet  zmath; Math. Notes, 41:1 (1987), 48–54  isi
12. A. E. Andreev, “On a method for obtaining more than quadratic effective lower bounds for the complexity of $\pi$-schemes”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1987, 1,  70–73  mathnet  mathscinet  zmath
1986
13. A. E. Andreev, “A family of Boolean matrices”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1986, 2,  97–100  mathnet  mathscinet  zmath
1985
14. A. E. Andreev, “The method of nonrepeated reduction of self-correcting circuit design”, Dokl. Akad. Nauk SSSR, 283:2 (1985),  265–269  mathnet  mathscinet  zmath
15. A. E. Andreev, “A method for obtaining lower bounds on the complexity of individual monotone functions”, Dokl. Akad. Nauk SSSR, 282:5 (1985),  1033–1037  mathnet  mathscinet  zmath
16. A. E. Andreev, “A universal principle of self-correction”, Mat. Sb. (N.S.), 127(169):2(6) (1985),  147–172  mathnet  mathscinet  zmath; Math. USSR-Sb., 55:1 (1986), 145–169
1984
17. A. E. Andreev, “Synthesis of self-correcting control systems”, Dokl. Akad. Nauk SSSR, 277:3 (1984),  521–525  mathnet  mathscinet  zmath
18. A. E. Andreev, “On the problem of minimization of disjunctive normal forms”, Dokl. Akad. Nauk SSSR, 274:2 (1984),  265–269  mathnet  mathscinet  zmath
1983
19. A. E. Andreev, “On the synthesis of disjunctive normal forms which are close to minimal”, Dokl. Akad. Nauk SSSR, 269:1 (1983),  11–15  mathnet  mathscinet  zmath; Dokl. Math., 27 (1983), 265–269
1981
20. A. E. Andreev, “On the design of self-correcting control systems”, Dokl. Akad. Nauk SSSR, 256:3 (1981),  521–524  mathnet  mathscinet  zmath
1980
21. A. E. Andreev, “Some questions concerning a pattern recognition test”, Dokl. Akad. Nauk SSSR, 255:4 (1980),  781–784  mathnet  mathscinet  zmath

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019