On properties of a matroid connected with the construction of bijunctive consequences of Boolean equations systems
Matematičeskie voprosy kriptografii, Tome 15 (2024) no. 4, pp. 91-112
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The article is devoted to the study of linear dependencies in a set of Boolean functions represented by elementary conjunctions of length 2. Values of the number of minimal linearly dependent sets of a special type and lower estimates of the number of linearly independent sets of a given cardinality are obtained.
[1] Tarasov A.V., “Ob odnom metode postroeniya sledstvii spetsialnogo vida dlya sistem bulevykh uravnenii”, Matematicheskie voprosy kriptografii, 14:1 (2023), 115–130 | DOI | MR | Zbl
[2] Gorshkov S.P., Tarasov A.V., Slozhnost resheniya sistem bulevykh uravnenii, Kurs, M., 2017, 192 pp.
[3] Uilson R., Vvedenie v teoriyu grafov, Dialektika, M.–SPb., 2019, 240 pp. | MR
[4] Gizunov S.A., Lyamin V.N., Psevdomatroidy i secheniya matroidov, Nauka, M., 2013, 165 pp.