  We show (almost) separation between certain important classes of Boolean
functions. The technique that we use is to show that the total influence of
functions in one class is less than the total influence of functions in the
other class. In particular, we show (almost) separation of several classes of
Boolean functions which have been studied in the coding theory and cryptography
from classes which have been studied in combinatorics and complexity theory.
