On estimating the complexity of threshold functions in terms of analogues of spectral norms

The class of Boolean, ternary and multivalued functions is considered. The complexity of the threshold representation of such functions is estimated and the class of threshold functions of polynomial complexity is characterized in terms of an analogue of $L_1$-the norm.