Библиография Лаврова И.А.

Ladner R.E. [1973] Mitotic recursively enumerable sets J. Symbolic Logic, 38, № 2, 199-211 74.07.120 OS article Вернуться к поиску

Ladner R.E. [1975] On the structure of polynomial time reducibilities J. Ass. Comput. Mach., 22, 155-171 75.98.849 O article Вернуться к поиску

Ladner R.E. [1973] A completely mitotic nonrecusively enumerable degree Trans. Amer. Math. Soc., 184, № 10, 479-507 74.08.70 OS article Вернуться к поиску

Ladner R.E.,Lynch N.F. Selman A. L. [1975] A comparison of polynomial time reducibilities Theor. Comp. Sci., 1, № 2, 103-123 76.B7.944 O article Вернуться к поиску

Ladner R.E., Sasso L.P. [1975] The weak truth table degrees of recursively enumerable sets Ann. Math. Logic, 8, № 4, 429-448 76.02.87 OS article Вернуться к поиску

Ladner R.E. [1980] Complexity theory with emphasis on the complexity of logical theories London Math. Soc. Lect. Notes, Cambridge Univ. Press, 45, 286-319 81.02.46 O article Вернуться к поиску

L La Roche P. Lachlan A. H. Lacombe D. Ladner R.E. LaForte G. Lakins T. Lambert W. M. Landweber L.H. Langford G. Läuchli H. Lavrov I.A. Lebeuf R. Leeds S. Leggett A. Leivant D. Lempp S. LeonardJ Leonhardi S.D. Lerman M. LewisA LewisFD LewisHR LewisPM LiAngs LiXiang Lipton R.J. Liu S.C. Loh Chang-wan ...