EUVIMEDEUVIMED entdecken
Crossref

On the strong affinity level of Boolean functions

Artem V. Kulagin, Alexey V. Tarasov

Prikladnaya Diskretnaya Matematika · 2026 · (71) · 29-43

DOI: 10.17223/20710410/71/2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Prikladnaya Diskretnaya Matematika, 2026. Verfasst von Artem V. Kulagin und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper studies a Boolean function parameter known as the strong affinity level, which is the minimum number of variables whose arbitrary values yield an affine function. The fundamental properties of the strong affinity level and its relationship to other Boolean function parameters are explored. The asymptotic maximality of the strong affinity level of Boolean functions is proven.

Zitieren

APA

Kulagin, A. V., & Tarasov, A. V. (2026). On the strong affinity level of Boolean functions. Prikladnaya Diskretnaya Matematika, 29-43. https://doi.org/10.17223/20710410/71/2

Vancouver

Kulagin AV, Tarasov AV. On the strong affinity level of Boolean functions. Prikladnaya Diskretnaya Matematika. 2026:29-43. doi:10.17223/20710410/71/2

BibTeX
@article{Kulagin2026,
  author = {Kulagin, Artem V. and Tarasov, Alexey V.},
  title = {On the strong affinity level of Boolean functions},
  journal = {Prikladnaya Diskretnaya Matematika},
  year = {2026},
  number = {71},
  pages = {29--43},
  doi = {10.17223/20710410/71/2}
}
Kostenlos starten →