RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika

Diskr. Mat., 2005, Volume 17, Issue 2, Pages 127–138 (Mi dm104)

Criteria for Boolean functions to be repetition-free in pre-elementary bases of rank 3
N. A. Peryazev, I. K. Sharankhaev

This publication is cited in the following articles:
  1. I. K. Sharankhaev, “O bespovtornykh bulevykh funktsiyakh v elementarnom bazise s medianoi”, Sib. elektron. matem. izv., 19:1 (2022), 378–386  mathnet  crossref  mathscinet
  2. Ivan Konstantinovich Sharankhaev, Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar “Discrete Mathematics and Its Applications”, 2022, 141  crossref
  3. I. K. Sharankhaev, “Repetition-free functions of the algebra of logic in pre-elementary bases”, Algebra and Logic, 58:2 (2019), 186–195  mathnet  crossref  crossref  isi
  4. Sharankhaev I.K., “O bespovtornykh bulevykh funktsiyakh v nekotorykh bazisakh”, Vestn. Buryatskogo gos. un-ta, 2010, no. 9, 237–243  elib
  5. I. K. Sharankhaev, “Realization of Boolean functions by repetition-free formulas in a particular base”, Siberian Math. J., 50:1 (2009), 188–192  mathnet  crossref  mathscinet  isi
  6. I. K. Sharankhaev, “On repetition-free Boolean functions over pre-elementary monotone bases”, Discrete Math. Appl., 19:3 (2009), 277–282  mathnet  crossref  crossref  mathscinet  elib


© Steklov Math. Inst. of RAS, 2026