Harmonic analysis and Boolean function complexity
From MaRDI portal
Publication:1272505
DOI10.1007/s100920050014zbMath0917.65118OpenAlexW2048409705MaRDI QIDQ1272505
Publication date: 3 January 1999
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s100920050014
Analysis of algorithms and problem complexity (68Q25) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items (8)
On the Walsh-Fourier analysis of Boolean functions ⋮ Learning intersections and thresholds of halfspaces ⋮ Boolean nested canalizing functions: a comprehensive analysis ⋮ Minimal polynomial of Cayley graph adjacency matrix for Boolean functions ⋮ Approximate location of relevant variables under the crossover distribution. ⋮ On spectral techniques in analysis of Boolean networks ⋮ Noise stability of functions with low influences: invariance and optimality ⋮ On the Fourier spectrum of symmetric Boolean functions
This page was built for publication: Harmonic analysis and Boolean function complexity
