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
Berman L. [1978] Relationships between density and nondeterministic complexity of NP -complete languages Lect. Notes in Comput. Sci.,62, 63-71, Springer-Verlag 81.B5.1063 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Berman L. [1976] On the structure of complete sets: almost everywhere complexity and infinitely often speed-up 17 Ann. Symp. Found. Comput. Sci., Providence, RI, 17, 76-80 76-80 78.B7.1190 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.... 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 S. BrownAB BrownDK Buchberger B. Büchi ...
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.