On the monotone complexity of the shift operator

05/26/2019

∙

by   Igor S. Sergeev, et al.

∙

0

∙

share

We show that the complexity of minimal monotone circuits implementing a monotone version of the shift operator on n boolean inputs is Θ(nlog n).