Conference material: "Academician O.B. Lupanov XIV International Scientific Seminar "Discrete Mathematics and Its Applications" (20-25 June 2022, Moscow)"
Authors:Kochergin V.V., Mikhailovich A.V.
Non-monotone complexity lower bound for multivalued functions
Abstract:
A lower estimate for the nonmonotone complexity of functions of a multivalued logic in an arbitrary complete finite basis, different from the upper estimates of nonmonotone complexity only for an additive constant, not basis dependent.
