A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
From MaRDI portal
Publication:1590080
DOI10.1007/PL00001599zbMath0963.68075MaRDI QIDQ1590080
Publication date: 19 December 2000
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 (10)
Weights of exact threshold functions ⋮ The correlation between parity and quadratic polynomials mod \(3\) ⋮ Covering symmetric sets of the Boolean cube by affine hyperplanes ⋮ Constructing Ramsey graphs from Boolean function representations ⋮ Characterization of robust immune symmetric Boolean functions ⋮ Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms ⋮ Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols ⋮ A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem] ⋮ Parity helps to compute majority ⋮ Unnamed Item
This page was built for publication: A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
