Separation results for boolean function classes

Authors

Aniruddha Biswas, Indian Statistical Institute, Kolkata
Palash Sarkar, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Cryptography and Communications

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

First Page

451

Last Page

458

DOI

10.1007/s12095-021-00488-w

Publication Date

5-1-2021

Comments

Open Access, Green

Recommended Citation

Biswas, Aniruddha and Sarkar, Palash, "Separation results for boolean function classes" (2021). Journal Articles. 1974.
https://digitalcommons.isical.ac.in/journal-articles/1974