@article{MVK_2013_4_1_a5,
author = {P. V. Roldugin and A. V. Tarasov},
title = {On the {Boolean} functions without upper bijunctive analogues},
journal = {Matemati\v{c}eskie voprosy kriptografii},
pages = {111--128},
year = {2013},
volume = {4},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MVK_2013_4_1_a5/}
}
P. V. Roldugin; A. V. Tarasov. On the Boolean functions without upper bijunctive analogues. Matematičeskie voprosy kriptografii, Tome 4 (2013) no. 1, pp. 111-128. http://geodesic.mathdoc.fr/item/MVK_2013_4_1_a5/
[1] Gorshkov S. P., “O slozhnosti raspoznavaniya multiaffinnosti, biyunktivnosti, slaboi polozhitelnosti i slaboi otritsatelnosti bulevykh funktsii”, Obozrenie prikladnoi i promyshlennoi matematiki, 4:2 (1997), 216–237
[2] Schaefer T., “Complexity of satisfiability problems”, Proceedings of the 10 Annual ACM Symposium on Theory of Computing, 1978, 216–226 | DOI | MR
[3] Gorshkov S. P., “Primenenie teorii NP-polnykh zadach dlya otsenki slozhnosti resheniya sistem bulevykh uravnenii”, Obozrenie prikladnoi i promyshlennoi matematiki, 2:3 (1995), 325–398 | MR
[4] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, M., 1986 | MR
[5] Sachkov V. N., Vvedenie v kombinatornye metody diskretnoi matematiki, Nauka, M., 1982 | MR | Zbl
[6] Raigorodskii A. M., Sistemy obschikh predstavitelei i ikh prilozheniya v geometrii, MTsNMO, M., 2006