|
|
|
Publications in Math-Net.Ru |
Citations |
|
1985 |
| 1. |
M. Kh. Aizenshtein, “Strong naming and pseudospeedup theorems for the capacity measure of complexity”, Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 5, 7–15    ; Soviet Math. (Iz. VUZ), 29:5 (1985), 1–12 |
| 2. |
M. Kh. Aizenshtein, “The computational complexity of the Needing invariant of explosive maps of the interval”, Uspekhi Mat. Nauk, 40:1(241) (1985), 179–180 ; Russian Math. Surveys, 40:1 (1985), 203–204  |
|
1981 |
| 3. |
M. Kh. Aizenshtein, “Subrecursive reducibility and accelerability”, Izv. Vyssh. Uchebn. Zaved. Mat., 1981, no. 6, 11–18 ; Soviet Math. (Iz. VUZ), 25:6 (1981), 11–18 |
|
1980 |
| 4. |
M. Kh. Aizenshtein, “On the existence of optimal algorithms for combinatorial problems and languages”, Uspekhi Mat. Nauk, 35:5(215) (1980), 221–222 ; Russian Math. Surveys, 35:5 (1980), 249–250 |
|
Contact us: