Alexandr Valyuzhenich. An upper bound on the number of relevant variables for Boolean functions on the Hamming graph. // Discrete Mathematics. – 2026. – DOI: 10.1016/j.disc.2025.114745. – URL: https://doi.org/10.1016/j.disc.2025.114745
Alexandr Valyuzhenich (2026). An upper bound on the number of relevant variables for Boolean functions on the Hamming graph. Discrete Mathematics. https://doi.org/10.1016/j.disc.2025.114745
Alexandr Valyuzhenich. “An upper bound on the number of relevant variables for Boolean functions on the Hamming graph.” Discrete Mathematics, 2026. doi:10.1016/j.disc.2025.114745.
@article{Valyuzhenich2026,
title = {An upper bound on the number of relevant variables for Boolean functions on the Hamming graph},
author = {Valyuzhenich, Alexandr},
journal = {Discrete Mathematics},
year = {2026},
doi = {10.1016/j.disc.2025.114745},
url = {https://doi.org/10.1016/j.disc.2025.114745}
}