A lower bound on the MOD 6 degree of the OR function
From MaRDI portal
Publication:1272657
DOI10.1007/PL00001597zbMath0936.68051MaRDI QIDQ1272657
David A. Mix Barrington, Gábor Tardos
Publication date: 6 April 1999
Published in: Computational Complexity (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (7)
Representing Boolean functions as polynomials modulo composite numbers ⋮ Constructing Ramsey graphs from Boolean function representations ⋮ Unnamed Item ⋮ Learning Read-Constant Polynomials of Constant Degree Modulo Composites ⋮ Learning read-constant polynomials of constant degree modulo composites ⋮ Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols ⋮ Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
This page was built for publication: A lower bound on the MOD 6 degree of the OR function
