Gupta, Ankit
(Indian Statistical Institute, Kolkata., 2021-07)
Boolean functions f : {−1, 1}
n → {−1, 1} arise in many areas of theoretical computer
science and mathematics, for example: complexity theory, quantum computing and graph
theory etc and Fourier analysis is a powerful ...