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
Long T. J. [1982] Strong nondeterministic polynomial time reducibilities Theor. Comp. Sci., 21, № 1, 1-25 83.В4.666 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Long T. J. [1982] A note on sparse oracles for NP J. Comp. and System Sci., 24, № 2, 224-232 82.B12.984 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Homer S. , Long T. J. [1987] Honest polynomial degrees and P =? NP Theor. Comput. Sci., 51, № 3, 265-280 88.Г4.326 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Long T. J., Selman A. L. [1986] Relativizing complexity classes with sparse oracles J. Ass. Comput. Mach., 33, 618-628 87.ВН2.29 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Long T. J. [1988] On restricting the size of oracles compared with restricting the access to the oracle SIAM J. Comput., 14, № 3, 585-597 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.... 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 LongTJ Longo G. Longpre L. Louveau A. Lowenthal F. Lu Hong Lubarsky R.S. Luckham D. Lynch N.A. Lyndon R.C. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.