Nigmatullin Roshal' Gabdulkhaevich

Publications in Math-Net.Ru

1. Two classes of proofs of lower bounds on complexity
   
   Dokl. Akad. Nauk SSSR, 294:2 (1987),  272–275
2. Lower bounds for complexity of monotone computation of polynomials and universal schemes
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 8,  35–42
3. Complexity of universal functions and lower bounds on complexity
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1984, no. 11,  10–20
4. The problem of lower bounds of complexity and the theory of NP-completeness (survey)
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1981, no. 5,  17–25
5. The complexity of languages of type $\cup\mathrm M$
   
   Zh. Vychisl. Mat. Mat. Fiz., 17:5 (1977),  1278–1284
6. Complexity of approximate solution of combinatorial problems
   
   Dokl. Akad. Nauk SSSR, 224:2 (1975),  289–292
7. The largest number of kernels in graphs with $n$ vertices
   
   Uchenye Zapiski Kazanskogo Universiteta, 130:3 (1970),  75–82
8. A uniform filling of the $n$-dimensional unit cube
   
   Uchenye Zapiski Kazanskogo Universiteta, 128:2 (1968),  95–98
9. The matchings of a graph
   
   Uchenye Zapiski Kazanskogo Universiteta, 128:2 (1968),  91–94
10. On the realization of quasi-monotone functions by contact schemes
    
    Uchenye Zapiski Kazanskogo Universiteta, 123:6 (1963),  119–128