A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/OR Circuits
IEEE Transactions on Computers
Generalized Transforms for Multiple Valued Circuits and Their Fault Detection
IEEE Transactions on Computers
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
The harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice
The harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice
Spectral Techniques in Digital Logic
Spectral Techniques in Digital Logic
Randomness, adversaries and computation (random polynomial time)
Randomness, adversaries and computation (random polynomial time)
A Characterization of Bent Functions in Terms of Strongly Regular Graphs
IEEE Transactions on Computers
Mixed-radix MVL Function Spectral and Decision Diagram Representation
Automation and Remote Control
Testing Fourier Dimensionality and Sparsity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Geometric and design-theoretic aspects of semibent functions I
Designs, Codes and Cryptography
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
Simulating quantum computers with probabilistic methods
Quantum Information & Computation
| Hi-index | 14.98 |
Several problems in digital logic can be conveniently approached in the spectral domain. In this paper we show that the Walsh spectrum of Boolean functions can be analyzed by looking at algebraic properties of a class of Cayley graphs associated with Boolean functions. We use this idea to investigate the Walsh spectrum of certain special functions.