Aizenshtein M Kh

Publications in Math-Net.Ru

1. Strong naming and pseudospeedup theorems for the capacity measure of complexity
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 5,  7–15
2. The computational complexity of the Needing invariant of explosive maps of the interval
   
   Uspekhi Mat. Nauk, 40:1(241) (1985),  179–180
3. Subrecursive reducibility and accelerability
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1981, no. 6,  11–18
4. On the existence of optimal algorithms for combinatorial problems and languages
   
   Uspekhi Mat. Nauk, 35:5(215) (1980),  221–222