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.
