Lower Bounds on Representing Boolean Functions as Polynomials in Z_m
From MaRDI portal
Publication:4875435
Recommendations
Cited in
(14)- On the degree of Boolean functions as real polynomials
- Representing the Boolean OR Function by Quadratic Polynomials Modulo 6
- On the modulo degree complexity of Boolean functions
- Constructing Ramsey graphs from Boolean function representations
- Representing Boolean functions as polynomials modulo composite numbers
- On the mean evaluation of polynomially reducible Boolean functions
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
- scientific article; zbMATH DE number 2081114 (Why is no real title available?)
- Polynomial Representations of Symmetric Partial Boolean Functions
- On the degree of univariate polynomials over the integers
- Circuit complexity before the dawn of the new millennium
- scientific article; zbMATH DE number 4179291 (Why is no real title available?)
- Hierarchical diagnostic classification models morphing into unidimensional `diagnostic' classification models -- a commentary
- On the modulo degree complexity of Boolean functions
This page was built for publication: Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875435)