Spectral analysis of Boolean functions as a graph eigenvalue problem

DOI10.1109/12.755000MaRDI QIDQ4571396zbMATH OpenOpenAlexFDO

Authors A. 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)

Cited in

(30)

• Independence polynomials of circulants with an application to music
• Connected graphs as subgraphs of Cayley graphs: conditions on hamiltonicity
• Bent and vectorial bent functions, partial difference sets, and strongly regular graphs
• On the decision tree complexity of threshold functions
• A survey on \(p\)-ary and generalized bent functions
• Generalized bent Boolean functions and strongly regular Cayley graphs
• Vectorial bent functions and partial difference sets
• A graph theoretic approach to construct desired cryptographic Boolean functions
• On spectral techniques in analysis of Boolean networks
• Alternation, sparsity and sensitivity: bounds and exponential gaps
• Twin bent functions and Clifford algebras
• Boolean function representation and spectral characterization using AND/OR graphs
• scientific article; zbMATH DE number 2168870 (Why is no real title available?)
• On the Cayley graphs of Boolean functions
• A short list of equalities induces large sign-rank
• Relationship between homogeneous bent functions and Nagy graphs
• Lifting Theorems for Equality
• scientific article; zbMATH DE number 7300318 (Why is no real title available?)
• scientific article; zbMATH DE number 7300419 (Why is no real title available?)
• Twin bent functions, strongly regular Cayley graphs, and Hurwitz-Radon theory
• A generalization of a theorem of Rothschild and van Lint
• A generalization of a theorem of Rothschild and van Lint
• Well-covered circulant graphs
• On the relationship between local affinities of a Boolean function and some types of its degeneracy
• Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique
• On parity decision trees for Fourier-sparse Boolean functions
• Lifting dichotomies
• On parity decision trees for Fourier-sparse Boolean functions
• On Fourier analysis of sparse Boolean functions over certain abelian groups
• Spatio-spectral limiting on Boolean cubes

This page was built for publication: Spectral analysis of Boolean functions as a graph eigenvalue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571396)