Fourier Sparsity of GF(2) Polynomials (Q5740202): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2215158699 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.02158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Norm of Symmetric Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binomial Coefficients Modulo a Prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Fourier Dimensionality and Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition Theorems in Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication is Bounded by Root of Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of Boolean functions with small spectral norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3636247 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:49, 12 July 2024

scientific article; zbMATH DE number 6605943
Language Label Description Also known as
English
Fourier Sparsity of GF(2) Polynomials
scientific article; zbMATH DE number 6605943

    Statements

    Identifiers