Separation results for Boolean function classes
DOI10.1007/s12095-021-00488-wzbMath1493.94070arXiv2010.11754OpenAlexW3096378413MaRDI QIDQ2119852
Palash Sarkar, Aniruddha Biswas
Publication date: 30 March 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.11754
bent functionsBoolean functionmonotone functionsstrict avalanche criteriontotal influenceplateaued functionconstant depth circuitslinear threshold functionpropagation characteristic
Voting theory (91B12) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14) Boolean functions (94D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptographic properties of monotone Boolean functions
- The average sensitivity of bounded-depth circuits
- On the Walsh-Hadamard transform of monotone Boolean functions
- On ``bent functions
- Spectral properties of threshold functions
- On the nonlinearity of monotone Boolean functions
- Fourier entropy influence conjecture for random linear threshold functions
- Constant depth circuits, Fourier transform, and learnability
- Harmonic Analysis of Polynomial Threshold Functions
- Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions
This page was built for publication: Separation results for Boolean function classes