O metricheskikh svoĭstvakh algoritmov tipa "Kora" dli︠a︡ odnogo klassa binarnykh tablit︠s︡

Moskva: Vychislitelʹnyĭ t︠s︡entr AN SSSR (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Call number

QA9.58.D58 1986

Links

PhilArchive



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

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

Spomenica Veljka Kora Ca.C. Milan Popovi, C. Veljko Kora, C. Mihailo Popovi & Univerzitet U. Beogradu - 1988 - Univerzitet U Beogradu, Filozofski Fakultet.
On the existence of fair matching algorithms.F. Masarani & S. S. Gokturk - 1989 - Theory and Decision 26 (3):305-322.
Osnovy teorii ėlementarnykh algoritmov.N. K. Kosovskiĭ - 1987 - Leningrad: Izd-vo Leningradskogo universiteta.
Grindlingér É. I.. O nérazréšimosti problémy toždéstva slov dlá odnogo klassa polugrupp s razréšimoj problèmoj izomorfizma. Doklady Akadémii Nauk SSSR, vol. 171 , pp. 519–520.Grindlinger [Greendlinger] E. I.. On the unsolvability of the word problem for a class of semigroups with a solvable isomorphism problem. English translation of the preceding by Greendlinger M.. Soviet mathematics, vol. 7 no. 6 , pp. 1502–1503. [REVIEW]C. R. J. Clapham - 1968 - Journal of Symbolic Logic 33 (3):469-469.
Teorii︠a︡ algoritmov: osnovnye otkrytii︠a︡ i prilozhenii︠a︡.V. A. Uspenskiĭ - 1987 - Moskva: "Nauka," Glav. red. fiziko-matematicheskoĭ lit-ry. Edited by A. L. Semenov.
Matematicheskie metody postroenii︠a︡ i analiza algoritmov.A. O. Slisenko & S. V. Solovʹev (eds.) - 1990 - Leningrad: "Nauka," Leningradskoe otd-nie.
Issledovanii︠a︡ po matematicheskoĭ logike i teorii algoritmov.Sh S. Pkhakadze (ed.) - 1982 - Tbilisi: Izd-vo Tbilisskogo universiteta.
Voprosy matematicheskoĭ logiki i teorii algoritmov.N. M. Nagornyĭ (ed.) - 1988 - Moskva: Vychislitelʹnyĭ t︠s︡entr AN SSSR.
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.
Logicheskie metody postroenii︠a︡ ėffektivnykh algoritmov: mezhduvedomstvennyĭ tematicheskiĭ sbornik nauchnykh trudov.M. I. Kanovich (ed.) - 1987 - Kalinin: Kalininskiĭ gos. universitet.
Mudrostʹ--li︠u︡bovʹ moi︠a︡: ėksperimentalʹnoe uchebnoe posobie po filosofii dli︠a︡ obuchai︠u︡shchikh v vuzakh, srednikh uchebnykh zavedenii︠a︡kh, shkolakh, dli︠a︡ vsekh li︠u︡boznatelʹnykh.V. I. Zorin - 1996 - Akmola: Myslitelʹ. Edited by Indira Zaripova.
Filosofii︠a︡ kulʹtury: dli︠a︡ vsekh i ni dli︠a︡ kogo v dostupnom izlozhenii.Ė. A. Pozdni︠a︡kov - 1999 - Moskva: "Inturreklama".
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.
Measuring power of algorithms, computer programs and information automata.Mark Semenovich Burgin (ed.) - 2010 - New York: Nova Science Publishers.
Pricing algorithms in oligopoly with decreasing returns.Jacques Thépot - 2021 - Theory and Decision 91 (4):493-515.

Analytics

Added to PP
2023-05-26

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