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
Beigel R.J., Gasarch W.I., Gill J., Owings J.C. [1993] Terse, superterse, and verbose sets Inform. Comput., 103 , № 1 , 68-85 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Beigel R.J., Gasarch W.I., Kummer M., Martin G., McNicholl T., Stephan F. [2000] The complexity of Odd n A J. Symbolic Logic, 65, № 1, 1-18 01.09.55 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kummer M. [1992] A proof of Beigel's cardinality conjecture J. Symbolic Logic, 57, № 2, 677-681 93.04.54 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Owings J.C. [1989] A cardinality version of Beigel’s nonspeedup theorem J. Symbolic Logic, 54, № 3, 761-767 90.09.40 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.B Badaev S. Bailey C.G. Baker T.P. Baleva V. Baratella S. Barback J. Barendregt H. Barmpalias G. Barwise J. Basu S. Baterman P.T. Baurle F.A. Batyrshin I.I. Becker H. Behman H. Beigel R.J. Belyaev V. N. Bennison V.L. Bentzien L. Bereznyuk S. Bergstra J. A. BermanL BermanP Bernardi C. Bernays P. Berry J. Bianchini C. Bickford M. Binns S. Blacino L. Blair H. A. Blaylock R. Blum M. Bojkova E. BookR Boolos G. Boon W.W. Börger E. Borodin ...
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.