News
General Theory of Computability
(bibliography)
by Lavrov I.A.
By Author Name:
English: A-B-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-Z
Русские: А-Б-В-Г-Д-Е-Ж-З-И-К-Л-М-Н-О-П-Р-С-Т-У-Ф-Х-Ц-Ч-Ш-Щ-Э-Ю-Я
Search
Hirst J.L., Lempp S. [1996] Infinite versions of some problems from finite complexity theory Notre Dame J. Formal Logic, 37, № 4, 545-553 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.... Harrington L.A. Harrison J. Harrop R. Harrow K. Hartmanis J. Haught C.A. Hay L. Heaton A.J. Hebeison F. Hecker H.D. Heidler K. Heller A. Helm J.P. Hemachandra L. Hensel G. Hermes H. Herrmann E. Hilbert D. Hinman P.G. Hird G.R. Hirose K. Hirschfeldt D. R. Hirst J.L. Hjorth G. HoKe Hodes H. T. HodgesA HodgesW Hodgson B.R. Homer S. Hopcroff J.E. Hořejš J. Horowitz B.M. HowardWA Hrbacek K. Hu Shin hua Hughes C.E. Hugill D. Hummel T. Huwig H. Hyland J.M.E. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.