Pages that link to "Item:Q1272657"
From MaRDI portal
The following pages link to A lower bound on the MOD 6 degree of the OR function (Q1272657):
Displayed 7 items.
- Constructing Ramsey graphs from Boolean function representations (Q397068) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols (Q2490262) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- (Q5874535) (← links)