Fourier Sparsity of GF(2) Polynomials

DOI10.1007/978-3-319-34171-2_29zbMath1482.12001arXiv1508.02158OpenAlexW2215158699MaRDI QIDQ5740202

Ning Xie, Hing Yin Tsang, Shengyu Zhang

Publication date: 25 July 2016

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.02158

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Finite fields (field-theoretic aspects) (12E20)

Related Items (3)

A generalization of a theorem of Rothschild and van Lint ⋮ A generalization of a theorem of Rothschild and van Lint ⋮ On the decision tree complexity of threshold functions

Cites Work

• Unnamed Item
• On the structure of Boolean functions with small spectral norm
• Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models
• Spectral Norm of Symmetric Functions
• Communication is Bounded by Root of Rank
• Composition Theorems in Communication Complexity
• Communication Complexity
• Binomial Coefficients Modulo a Prime
• Testing Fourier Dimensionality and Sparsity

This page was built for publication: Fourier Sparsity of GF(2) Polynomials