scientific article; zbMATH DE number 1332656
From MaRDI portal
Publication:4259977
zbMATH Open0922.06014MaRDI QIDQ4259977FDOQ4259977
Authors: Vince Grolmusz 
Publication date: 7 September 1999
Title of this publication is not available (Why is that?)
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
lower boundsrepresentation of Boolean functionsgeneralized inner product functionweak degree of a Boolean function
Cited In (8)
- Constructing Ramsey graphs from Boolean function representations
- On the power of circuits with gates of low \(L_{1}\) norms.
- Circuit complexity before the dawn of the new millennium
- Title not available (Why is that?)
- Learning read-constant polynomials of constant degree modulo composites
- Harmonic analysis, real approximation, and the communication complexity of Boolean functions
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
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)
