Separation Results for Boolean Function Classes
Computational Complexity
2020-10-23 v1 Cryptography and Security
Abstract
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.
Keywords
Cite
@article{arxiv.2010.11754,
title = {Separation Results for Boolean Function Classes},
author = {Aniruddha Biswas and Palash Sarkar},
journal= {arXiv preprint arXiv:2010.11754},
year = {2020}
}