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
Bennison V.L. [1980] Recursively enumerable complexity sequences and measure independence J. Symbolic Logic, 45, № 3, 417-438 81.05.47 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Bennison V.L., Soare R.I. [1978] Some lowness properties and computational complexity sequences Theor. Comput. Sci., 6, № 3, 233-254 78.B11.1096 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Bennison V.L. [1979] Information content characterizations of complexity theoreticic properties, Lect. Notes in Comp. Sci., 67, 58-66, Springer -Verlag 79.B11.842 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Bennison V.L., Soare R.I. [1977] Recursion theoretic characterization of complexity-theoretical properties 18 Ann. Symp. Found. Comput. Sci., Providence, RI, 100-106 78.B12.1611 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 A. Boyd R. Brandt U. Breidbart ...
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.