Spectral analysis of Boolean functions as a graph eigenvalue problem

DOI10.1109/12.755000zbMath1391.94908OpenAlexW2099718824MaRDI QIDQ4571396

Anna Bernasconi, Bruno Codenotti

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.755000

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Bent and vectorial bent functions, partial difference sets, and strongly regular graphs, Spatio-spectral limiting on Boolean cubes, Alternation, sparsity and sensitivity: bounds and exponential gaps, A survey on \(p\)-ary and generalized bent functions, Twin Bent Functions and Clifford Algebras, Twin bent functions, strongly regular Cayley graphs, and Hurwitz-Radon theory, A Short List of Equalities Induces Large Sign-Rank, Relationship between homogeneous bent functions and Nagy graphs, Generalized bent Boolean functions and strongly regular Cayley graphs, Well-covered circulant graphs, Vectorial bent functions and partial difference sets, A generalization of a theorem of Rothschild and van Lint, Sensitivity, affine transforms and quantum communication complexity, A generalization of a theorem of Rothschild and van Lint, A graph theoretic approach to construct desired cryptographic Boolean functions, Lifting Theorems for Equality, Independence polynomials of circulants with an application to music, Unnamed Item, Unnamed Item, Connected graphs as subgraphs of Cayley graphs: conditions on hamiltonicity, On the decision tree complexity of threshold functions, ON THE CAYLEY GRAPHS OF BOOLEAN FUNCTIONS