Lower Bounds on Representing Boolean Functions as Polynomials in Z_m
From MaRDI portal
Lower Bounds on Representing Boolean Functions as Polynomials in $Z m $
Recommendations
Cited in
(17)- A lower bound on the MOD 6 degree of the OR function
- The expressive power of voting polynomials
- On the degree of Boolean functions as real polynomials
- Representing Boolean functions as polynomials modulo composite numbers
- Hierarchical diagnostic classification models morphing into unidimensional `diagnostic' classification models -- a commentary
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
- scientific article; zbMATH DE number 4179291 (Why is no real title available?)
- Constructing Ramsey graphs from Boolean function representations
- scientific article; zbMATH DE number 1223714 (Why is no real title available?)
- scientific article; zbMATH DE number 2081114 (Why is no real title available?)
- Representing the Boolean OR Function by Quadratic Polynomials Modulo 6
- Polynomial Representations of Symmetric Partial Boolean Functions
- On the degree of univariate polynomials over the integers
- On the modulo degree complexity of Boolean functions
- On the modulo degree complexity of Boolean functions
- On the mean evaluation of polynomially reducible Boolean functions
- Circuit complexity before the dawn of the new millennium
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)
