Search results
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
Watanabe O. [1987] A comparison of polynomial time completeness notions Theor. Comput. Sci., 54, № 2-3, 143-156 88.Г9.297; O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ogiwara M., Watanabe O. [1991] On polynomial-time bounded truth-table reducibility of NP to sparse sets SIAM J. Comput., 20, № 3, 471-483 92.Г7.111 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.W WagnerEG WagnerK Wagner.KW Wainer S.S. Wald K. Walk S. WangHao WangJ Watanabe O. Watnick R. Watson P. WeberF Weber.FP WeberR Wechsung G. Wehner S. Weihrauch K. Weitkamp G. WelchL Welch.LV WelchPD Weyuker E. White W. Wiehagen R. Winklmann K. Woodin H.W. Woods A.R. Wrathall C. Wright J. B. Wu G. Вернуться на главную ...
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.