@article{MVK_2012_3_1_a3,
author = {S. V. Polin},
title = {Solution of equations by the sequential grouping method and its optimization},
journal = {Matemati\v{c}eskie voprosy kriptografii},
pages = {97--123},
year = {2012},
volume = {3},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MVK_2012_3_1_a3/}
}
S. V. Polin. Solution of equations by the sequential grouping method and its optimization. Matematičeskie voprosy kriptografii, Tome 3 (2012) no. 1, pp. 97-123. http://geodesic.mathdoc.fr/item/MVK_2012_3_1_a3/
[1] Asanov M. O., Baranskii V. A., Rasin V. V., Diskretnaya matematika: Grafy, matroidy, algoritmy, NITs “RKhD”, Izhevsk, 2001
[2] Balakin G. V., “Vvedenie v teoriyu sluchainykh uravnenii”, Trudy po diskretnoi matematike, 1, 1997, 1–18 | MR | Zbl
[3] Borovkov A. A., Teoriya veroyatnostei, “Editorial URSS”, M., 1999 | MR
[4] Grettser G., Obschaya teoriya reshetok, “Mir”, M., 1982 | MR
[5] Kurosh A. G., Lektsii po obschei algebre, “Nauka”, M., 1973 | MR
[6] Plotkin B. I., Gruppy avtomorfizmov algebraicheskikh sistem, “Nauka”, M., 1966 | MR | Zbl
[7] Reingold E., Nivergelt Yu., Deo N., Kombinatornye algoritmy. Teoriya i praktika, “Mir”, M., 1980 | MR | Zbl
[8] Shiryaev A. N., Veroyatnost–1, MTsNMO, M., 2004
[9] Shnaier B., Prikladnaya kriptografiya. Protokoly, algoritmy, iskhodnye teksty na yazyke Si, “Triumf”, M., 2002