Moshkov M Yu

Publications in Math-Net.Ru

1. The depth of decision trees for binary problems
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2007, no. 3,  25–29
2. On the works of R. G. Nigmatullin on approximate algorithms for solving discrete extremal problems
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 7:1 (2000),  6–17
3. Bounds for the depth of decision trees that compute Boolean functions
   
   Dokl. Akad. Nauk, 350:1 (1996),  22–24
4. Lower bounds for the time complexity of deterministic conditional tests
   
   Diskr. Mat., 8:3 (1996),  98–110
5. Decision trees with quasilinear tests
   
   Trudy Inst. Mat. SO RAN, 27 (1994),  108–141
6. On conditional tests
   
   Dokl. Akad. Nauk SSSR, 265:3 (1982),  550–552