Teorii︠a︡ algoritmov: osnovnye otkrytii︠a︡ i prilozhenii︠a︡

Moskva: "Nauka," Glav. red. fiziko-matematicheskoĭ lit-ry. Edited by A. L. Semenov (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Call number

QA9.58.U76 1987

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

  • This entry has no external links. Add one.
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

Teorii︠a︡ algoritmov i ee prilozhenii︠a︡: sbornik nauchnykh trudov.I︠U︡. L. Ershov & S. S. Goncharov (eds.) - 1989 - Novosibirsk: Akademii︠a︡ nauk SSSR, Sibirskoe otd-nie, In-t matematiki.
Osnovy teorii ėlementarnykh algoritmov.N. K. Kosovskiĭ - 1987 - Leningrad: Izd-vo Leningradskogo universiteta.
Matematicheskie metody postroenii︠a︡ i analiza algoritmov.A. O. Slisenko & S. V. Solovʹev (eds.) - 1990 - Leningrad: "Nauka," Leningradskoe otd-nie.
Voprosy matematicheskoĭ logiki i teorii algoritmov.N. M. Nagornyĭ (ed.) - 1988 - Moskva: Vychislitelʹnyĭ t︠s︡entr AN SSSR.
Issledovanii︠a︡ po matematicheskoĭ logike i teorii algoritmov.Sh S. Pkhakadze (ed.) - 1975 - Tbilisi: Izd-vo Tbilisskogo universiteta.
Teorii︠a︡ algorifmov.A. A. Markov - 1996 - Moskva: FAZIS. Edited by N. M. Nagornyĭ.
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.
Teorii︠a︡ dialektiki i obshchai︠a︡ teorii︠a︡ nauki.N. F. Tarasenko (ed.) - 1989 - Kiev: Izd-vo pri Kievskom gos. universitete izdatelʹskogo obʺedinenii︠a︡ "Vyshcha shkola".
Teorii︠a︡ poznanii︠a︡, simvologii︠a︡: teorii︠a︡ simvolicheskikh form.V. V. Ilʹin - 2013 - Moskva: Moskovskiĭ gos. universitet.
Measuring power of algorithms, computer programs and information automata.Mark Semenovich Burgin (ed.) - 2010 - New York: Nova Science Publishers.
Svetovnoto ravnovesie i teorii︠a︡ na poznanieto: teorii︠a︡ na poznanieto i ni︠a︡koi vŭprosi na ontologii︠a︡ta ot ekilibrologichna gledna tochka.Bozhidar Pali︠u︡shev - 1993 - Vrat︠s︡a: Nabor i pechat "Poliprint", EAD.
Teorii︠a︡ poznanii︠a︡ v chetyrekh tomakh.V. A. Lektorskiĭ & T. I. Oĭzerman (eds.) - 1991 - Moskva: "Myslʹ".
Algorithms from THE BOOK.Kenneth Lange - 2020 - Philadelphia, PA: The Society for Industrial and Applied Mathematics.
I. Žuravlév Ú.. O névozmožnosti postroéniá minimal'nyh dizúnktivnyh normal'nyh form funkcij algébry logiki v odnom kassé algoritmov. Doklady Akadémii Nauk SSSR, vol. 132 , pp. 504–506.Žuravlev Yu. I.. On the impossibility of constructing minimal disjunctive normal forms for functions of the algebra of logic in a single class of algorithms. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 1 no. 3 , pp. 581–583. [REVIEW]Andrzej Rowicki - 1965 - Journal of Symbolic Logic 30 (3):379-379.
Prilozhenii︠a︡ k proizvedenii︠a︡m E. Shiffersa: kommentarii, bibliografii︠a︡, ukazateli.Evgeniĭ Shiffers - 2005 - Moskva: Russkiĭ institut. Edited by O. I. Genisaretskiĭ & Evgeniĭ Shiffers.

Analytics

Added to PP
2023-05-25

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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