Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDM_2009_2_a4,
author = {N. G. Parvatov},
title = {Completeness problems for descrete functions},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {56--78},
publisher = {mathdoc},
number = {2},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2009_2_a4/}
}
N. G. Parvatov. Completeness problems for descrete functions. Prikladnaâ diskretnaâ matematika, no. 2 (2009), pp. 56-78. http://geodesic.mathdoc.fr/item/PDM_2009_2_a4/
[1] Kurosh A. G., Lektsii po obschei algebre, Uchebnik, Lan, SPb., 2005.
[2] Kon P., Universalnaya algebra, Mir, M., 1968. | MR
[3] Birkhoff G., Frink O., “Representations of lattices by sets”, Transactions on American Mathematical Society, 64 (1948), 299–316 | DOI | MR | Zbl
[4] Kuznetsov A. V., “Struktury s zamykaniem i kriterii funktsionalnoi polnoty”, Uspekhi matem. nauk., 16:2(98) (1961), 201–202
[5] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, M., 1986 | MR
[6] Yablonskii S. V., “Funktsionalnye postroeniya v $k$-znachnoi logike”, Trudy matematicheskogo instituta im. Steklova, 51, 1958, 5–142
[7] Bodnarchuk V. G., Kaluzhnin L. A., Kotov V. N., Romov B. A., “Teoriya Galua dlya algebr Posta”, Kibernetika, 1969, no. 3, 1–10 ; No 5, 1–9 | MR | Zbl
[8] Yablonskii S. V., “O stroenii verkhnei okrestnosti dlya predikatno-opisuemykh klassov v $P_k$”, Dokl. AN SSSR, 218:2 (1974), 304–307
[9] Maltsev A. I., Iterativnye algebry Posta, Izd-vo Novosib. un-ta, Novosibirsk, 1976 | MR
[10] Maltsev A. I., “Iterativnye algebry i mnogoobraziya Posta”, Algebra i logika, 5:2 (1966), 5–24 | MR
[11] Parvatov N. G., “Zamechaniya o konechnoi porozhdaemosti zamknutykh klassov”, Diskret. analiz i issled. operatsii. Ser. 1, 11:3 (2004), 32–47 | MR | Zbl
[12] Parvatov N. G., “Nasledstvennye sistemy diskretnykh funktsii”, Diskret. analiz i issled. operatsii. Ser. 2, 14:2 (2007), 76–91
[13] Parvatov N. G., “O nekotorykh svoistvakh operatsii zamykaniya, svyazannykh s problemami vyrazimosti”, Vestnik Tomskogo gosuniversiteta. Upravlenie, vychislitelnaya tekhnika i informatika, 2008, no. 3(4), 119–124
[14] Distel R., Teoriya grafov, Izd-vo In-ta matematiki, Novosibirsk, 2002
[15] Rige Zh., “Binarnye otnosheniya, zamykaniya, sootvetstviya Galua”, Kiberneticheskii sbornik, 7, IL, M., 1963, 129–185
[16] Yablonskii S. V., “O nevozmozhnosti eliminatsii perebora vsekh funktsii iz $P_2$ pri reshenii nekotorykh zadach teorii skhem”, DAN SSSR, 124:1 (1959), 44–47 | MR
[17] Lupanov O. B., “O sinteze nekotorykh klassov upravlyayuschikh sistem”, Problemy kibernetiki, 10, 1963, 61–80 | MR
[18] Wegener I., The complexity of Boolean functions, Wiley–Teubner, 1987, 458 pp. | MR | Zbl
[19] Alekseev V. B., “Ot metoda Karatsuby dlya bystrogo umnozheniya chisel k bystrym algoritmam dlya diskretnykh funktsii”, Analiticheskaya teoriya chisel i eë prilozheniya, Trudy MIAN, 218, Nauka, M., 1997, 20–27 | MR | Zbl
[20] Baker K. A., Pixly A. F., “Polynomial interpolation and Chinese remainder theorem for algebraic systems”, Math. Zeiteschr., 143:2 (1975), 165–174 | DOI | MR | Zbl
[21] Marchenkov S. S., “K suschestvovaniyu konechnykh bazisov v zamknutykh klassakh bulevykh funktsii”, Algebra i logika, 23:1 (1984), 88–99 | MR | Zbl
[22] Gavrilov G. P., “Induktivnye predstavleniya bulevykh funktsii i konechnaya porozhdaemost klassov Posta”, Algebra i logika, 23:1 (1984), 3–26 | MR | Zbl
[23] Marchenkov S. S., “O ravnomernom $id$-razlozhenii bulevykh funktsii”, Diskretnaya matematika, 2:3 (1990), 29–41 | MR | Zbl