An upper bound on the number of relevant variables for Boolean functions on the Hamming graph

Documenti analoghi

• On strong nodal domains for eigenfunctions of Hamming graphs
  di: Valyuzhenich, Alexandr, et al.
  Pubblicazione: (2025)
• On $P$-crucial square-free permutations
  di: Valyuzhenich, Alexandr
  Pubblicazione: (2025)
• Bicrucial $k$-power-free permutations
  di: Akhmejanova, Margarita, et al.
  Pubblicazione: (2024)
• On degree-$3$ and $(n-4)$-correlation-immune perfect colorings of $n$-cubes
  di: Krotov, Denis S., et al.
  Pubblicazione: (2023)
• Spectral upper bounds for the Grundy number of a graph
  di: Assis, Thiago, et al.
  Pubblicazione: (2024)