Andreev Aleksandr Egorovich

Publications in Math-Net.Ru

1. Test recognition
   
   Fundam. Prikl. Mat., 15:4 (2009),  67–99
2. On algorithm complexity
   
   Fundam. Prikl. Mat., 15:3 (2009),  135–181
3. On linear hashing of binary sets
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1997, no. 2,  22–25
4. Automaton complexity of two-place Boolean bases
   
   Diskr. Mat., 8:4 (1996),  123–133
5. О сложности нумеpующих опеpатоpов
   
   Diskr. Mat., 8:4 (1996),  44–56
6. Complexity of automata that compute the values of formulas
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1996, no. 4,  22–24
7. An almost optimal hitting set
   
   Dokl. Akad. Nauk, 340:4 (1995),  453–455
8. On the completeness of gradient gate circuits
   
   Diskr. Mat., 7:1 (1995),  66–76
9. Estimates for the length of a code for schemes consisting of functional elements
   
   Diskr. Mat., 6:4 (1994),  10–20
10. On a method for the synthesis of formulas
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1994, no. 6,  23–27
11. The complexity of realizing partial Boolean functions by schemes consisting of functional elements
    
    Diskr. Mat., 1:4 (1989),  36–45
12. A method for obtaining effective lower bounds on monotone complexity
    
    Algebra Logika, 26:1 (1987),  3–26
13. The complexity of the realization of subdefinite matrices by gate schemes
    
    Mat. Zametki, 41:1 (1987),  77–86
14. 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, no. 1,  70–73
15. A family of Boolean matrices
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1986, no. 2,  97–100
16. The method of nonrepeated reduction of self-correcting circuit design
    
    Dokl. Akad. Nauk SSSR, 283:2 (1985),  265–269
17. A method for obtaining lower bounds on the complexity of individual monotone functions
    
    Dokl. Akad. Nauk SSSR, 282:5 (1985),  1033–1037
18. A universal principle of self-correction
    
    Mat. Sb. (N.S.), 127(169):2(6) (1985),  147–172
19. Complexity of monotonic functions
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1985, no. 4,  83–87
20. A modification of the gradient algorithm
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1985, no. 3,  29–35
21. On the number of maximum intervals
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1985, no. 2,  13–16
22. Synthesis of self-correcting control systems
    
    Dokl. Akad. Nauk SSSR, 277:3 (1984),  521–525
23. On the problem of minimization of disjunctive normal forms
    
    Dokl. Akad. Nauk SSSR, 274:2 (1984),  265–269
24. On the synthesis of disjunctive normal forms which are close to minimal
    
    Dokl. Akad. Nauk SSSR, 269:1 (1983),  11–15
25. On the design of self-correcting control systems
    
    Dokl. Akad. Nauk SSSR, 256:3 (1981),  521–524
26. Some questions concerning a pattern recognition test
    
    Dokl. Akad. Nauk SSSR, 255:4 (1980),  781–784