scientific article; zbMATH DE number 1332656

MaRDI QIDQ4259977zbMATH OpenFDO

Authors Vince Grolmusz

Publication date 7 September 1999

zbMATH Keywords

generalized inner product functionlower boundsrepresentation of Boolean functionsweak degree of a Boolean function

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• scientific article; zbMATH DE number 2047492
• On the modulo degree complexity of Boolean functions
• On the modulo degree complexity of Boolean functions
• On Weak and Strong -Bent Boolean Functions
• The complexity of modular decomposition of Boolean functions
• On the multiplicative complexity of some Boolean functions
• On the multiplicative complexity of Boolean functions
• On representation and approximation of operations in Boolean algebras
• On the \(q\)-bentness of Boolean functions
• ON M-REPRESENTATION OF M-COMPLETE PSEUDO BOOLEAN ALGEBRA

Cited in

(10)

• A lower bound on the MOD 6 degree of the OR function
• On the power of circuits with gates of low \(L_{1}\) norms.
• Learning read-constant polynomials of constant degree modulo composites
• Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites
• Constructing Ramsey graphs from Boolean function representations
• scientific article; zbMATH DE number 2081114 (Why is no real title available?)
• Lower Bounds on Representing Boolean Functions as Polynomials in Z_m
• Harmonic analysis, real approximation, and the communication complexity of Boolean functions
• Circuit complexity before the dawn of the new millennium

This page was built for publication:

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