Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+T06
@@ Property / Mathematics Subject Classification ID: 11T06 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q87
@@ Property / Mathematics Subject Classification ID: 68Q87 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 94C10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6251997
@@ Property / zbMATH DE Number: 6251997 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+small-depth circuits
@@ Property / zbMATH Keywords: small-depth circuits / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+low-degree polynomials
@@ Property / zbMATH Keywords: low-degree polynomials / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+pseudorandom generators
@@ Property / zbMATH Keywords: pseudorandom generators / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00037-012-0051-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2047062580
@@ Property / OpenAlex ID: W2047062580 / rank @@
+Normal rank
@@ Property / cites work @@
+Small-Bias Probability Spaces: Efficient Constructions and Applications
+Normal rank
@@ Property / cites work @@
+Simple Constructions of Almost k-wise Independent Random Variables
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Polylogarithmic Independence Can Fool DNF Formulas
+Normal rank
@@ Property / cites work @@
+Pseudorandom Bits for Polynomials
@@ Property / cites work: Pseudorandom Bits for Polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Polylogarithmic independence fools             <i>AC</i>             <sup>0</sup>             circuits
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
+Normal rank
@@ Property / cites work @@
+Approximate inclusion-exclusion
@@ Property / cites work: Approximate inclusion-exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002801
@@ Property / cites work: Q3002801 / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+Pseudorandom Bit Generators That Fool Modular Sums
+Normal rank
@@ Property / cites work @@
+Small-Bias Spaces for Group Products
@@ Property / cites work: Small-Bias Spaces for Group Products / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom bits for constant depth circuits
@@ Property / cites work: Pseudorandom bits for constant depth circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:395606