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 coding theory and cryptography from classes which have been studied in combinatorics and complexity theory.

中文翻译：

---

布尔函数类的分离结果

我们展示了（几乎）布尔函数的某些重要类之间的分离。我们使用的技术是证明一类功能的总影​​响力小于另一类功能的总影​​响力。特别是，我们展示了（几乎）将在编码理论和密码学中研究过的几类布尔函数与在组合学和复杂性理论中研究过的几类分开。