Trahténbrot B. A.. Asimptotičéskaá océnka složnosti logičéskih sétéj s památ′ú. Doklady Akadémii Nauk SSSR, vol. 127 , pp. 281–284.Trahtenbrot B. A.. Asymptotic evaluation of the complexity of logic nets with memory. English translation of the above. Automation express,, vol. 2 , pp. 13–14 [Book Review]

Journal of Symbolic Logic 29 (2):100-100 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s0022481200116834

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Trahténbrot B. A.. Sintéz logičéskih sétéj, opératory kotoryh opisany srédstvami isčisléniá odnoméstnyh predikátov . Doklady Akadémii Nauk SSSR, vol. 118 , pp. 646–649. [REVIEW]Andrzej Blikle - 1963 - Journal of Symbolic Logic 28 (3):254-255.
Trahténbrot B. A.. Ob opératorah réalizuémyh v logičéskih sétah . Doklady Akadémii Nauk SSSR, vol. 112 , pp. 1005–1007.Andrzej Blikle - 1962 - Journal of Symbolic Logic 27 (2):252-253.
B. A. Trahténbrot. Ob avtosvodimosti. Doklady Akadémii Nauk SSSR, vol. 192 , pp. 1224–1227. - B. A. Trahtenbrot. On autoreducibility. English translation of the preceding by M. Machover. Soviet mathematics, vol. 11 no. 3 , pp. 814–817. [REVIEW]Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (3):527.
Trahténbrot B. A.. Tabličnoé prédstavlénié rékursivnyh opératorov . Doklady Akadémii Nauk SSSR, vol. 101 , pp. 417–420.Andrzej Mostowski - 1956 - Journal of Symbolic Logic 21 (2):207-208.
Trahténbrot B. A.. Nékotoryé postroéniá v logiké odnoméstnyh. prédikatov . Doklady Akadémii Nauk SSSR vol. 138 , pp. 320–321. [REVIEW]Andrzej Mostowski - 1964 - Journal of Symbolic Logic 29 (2):100-100.
Trahténbrot B. A.. O rékursivnoj otdélimosti . Doklady Akadémii Nauk SSSR, vol. 88 , pp. 953–956.Andrzej Mostowski - 1954 - Journal of Symbolic Logic 19 (1):60-60.
Trahténbrot B. A.. Konéčnyé avtomaty i logika odnoméstnyh predikátov . Doklady Akadémii Nauk SSSR, vol. 138 , pp. 326–329. [REVIEW]Jiří Bečvář - 1964 - Journal of Symbolic Logic 29 (2):100-100.
B. M. Kloss. K oprédéléniú složnosti algoritmov. Doklady Akademii Nauk SSSR, vol. 157 , pp. 38–40. - B. M. Kloss. The definition of complexity of algorithms. English translation of the preceding by S. L. Bloom. Soviet Mathematics, vol. 5 no. 4 , pp. 880–882. [REVIEW]Alan Cobham - 1969 - Journal of Symbolic Logic 34 (3):509.
Trahténbrot B. A.. Névozmožnost' algorifma dlá problémy razréšimosti na konéčnyh klassah . Doklady Akademii Nauk SSSR, vol. 70 , pp. 569–572. [REVIEW]Andrzej Mostowski - 1950 - Journal of Symbolic Logic 15 (3):229-229.
Kuznécov A. V. and Trahténbrot B. A.. Isslédovanié častično-rékursivnyh opératorov srédstvami téorii berovskogo prostranstva . Doklady Akadémii Nauk SSSR, vol. 105 , pp. 897–900. [REVIEW]J. W. Addison - 1957 - Journal of Symbolic Logic 22 (3):301-302.

Analytics

Added to PP
2016-06-30

Downloads
16 (#904,551)

6 months
3 (#1,207,367)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references