On the complexity of balanced Boolean functions

DOI10.1016/S0020-0190(99)00061-7zbMath1002.68063OpenAlexW1999338346MaRDI QIDQ1606934

R. Smith

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00061-7

zbMATH Keywords

balanced Boolean functions

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Bounds on the Fourier coefficients of the weighted sum function ⋮ On the nonlinearity of the sequence of signs of Kloosterman sums

This page was built for publication: On the complexity of balanced Boolean functions