Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Gashkov S. B., Kochergin V. V., “Ob additivnykh tsepochkakh vektorov, ventilnykh skhemakh i slozhnosti vychisleniya stepenei”, Metody diskretnogo analiza v teorii grafov i slozhnosti, Sb. nauchn. tr. Vyp. 52, In-t matematiki SO RAN, Novosibirsk, 1992, 22–40 | Zbl
[2] Kargapolov M. I., Merzlyakov Yu. I., Osnovy teorii grupp, 3-e izd., Nauka, M., 1982 | Zbl
[3] Knut D. E., Iskusstvo programmirovaniya dlya EVM, T. 2, Mir, M., 1977 | Zbl
[4] Kochergin V. V., “O slozhnosti vychislenii odnochlenov i naborov stepenei”, Diskretnyi analiz, Tr. RAN. Sib. otd-nie. In-t matematiki, 27, Izd-vo In-ta matematiki SO RAN, Novosibirsk, 1994, 94–107
[5] Kochergin V. V., “O dvukh obobscheniyakh zadachi ob additivnykh tsepochkakh”, Trudy IV Mezhdunarodnoi konferentsii “Diskretnye modeli v teorii upravlyayuschikh sistem”, 19–25 iyunya 2000 g., MAKS Press, M., 2000, 55–59
[6] Kochergin V. V., “O slozhnosti vychisleniya pary odnochlenov ot dvukh peremennykh”, Diskretnaya matematika, 17:4 (2005), 116–142 | Zbl
[7] Kochergin V. V., “Ob asimptotike slozhnosti additivnykh vychislenii sistem tselochislennykh lineinykh form”, Diskret. analiz i issled. operatsii. Ser. 1, 13:2 (2006), 38–58
[8] Kochergin V. V., “O slozhnosti vychisleniya sistem odnochlenov ot dvukh peremennykh”, Trudy VII Mezhdunarodnoi konferentsii “Diskretnye modeli v teorii upravlyayuschikh sistem”, Pokrovskoe, 4–6 marta 2006 g., MAKS Press, M., 2006, 185–190
[9] Kochergin V. V., “O slozhnosti sovmestnogo vychisleniya trekh odnochlenov ot trekh peremennykh”, Matematicheskie voprosy kibernetiki, Vyp. 15, Fizmatlit, M., 2006, 79–155
[10] Kochergin V. V., “O slozhnosti sovmestnogo vychisleniya dvukh elementov svobodnoi abelevoi gruppy”, Materialy XVI Mezhdunarodnoi shkoly-seminara “Sintez i slozhnost upravlyayuschikh sistem”, Sankt-Peterburg, 26–30 iyunya 2006 g., Izd-vo mekhaniko-matematicheskogo fakulteta MGU, M., 2006, 54–59
[11] Kochergin V. V., “O slozhnosti vychisleniya sistem odnochlenov i sistem tselochislennykh lineinykh form”, Diskretnaya matematika i ee prilozheniya, Sbornik lektsii molodezhnykh nauchnykh shkol po diskretnoi matematike i ee prilozheniyam. Vyp. III, Izd-vo mekhaniko-matematicheskogo fakulteta MGU, M., 2007, 3–63
[12] Kochergin V. V., “O maksimalnoi slozhnosti vychisleniya sistem elementov svobodnoi abelevoi gruppy”, Vestnik Moskovskogo universiteta. Ser. 1. Matematika. Mekhanika, 2007, no. 3, 15–20
[13] Lupanov O. B., “Ob odnom podkhode k sintezu upravlyayuschikh sistem – printsipe lokalnogo kodirovaniya”, Problemy kibernetiki, Vyp. 14, Nauka, M., 1965, 31–110
[14] Mikhalev A. V., Mishina A. P., “Beskonechnye abelevy gruppy: metody i rezultaty”, Fundamentalnaya i prikladnaya matematika, 1:2 (1995), 319–375 | Zbl
[15] Sidorenko A. F., “Slozhnost additivnykh vychislenii semeistv tselochislennykh lineinykh form”, Teoreticheskie primeneniya metodov matematicheskoi logiki. III, Zapiski nauchnykh seminarov LOMI, 105, Nauka, L., 1981, 53–61 | Zbl
[16] Sevidzh D. E., Slozhnost vychislenii, Izd-vo Faktorial, M., 1998
[17] Knuth D. E., Papadimitriou C. H., “Duality in addition chains”, Bulletin of the European Association for Theoretical Computer Science, 1981, no. 13, 2–4
[18] Morgenstern J., “Note on a lower bound of the linear complexity of the fast Fourier transform”, J. Assoc. Comput. Mach., 20:2 (1973), 305–306 | Zbl