Random low-degree polynomials are hard to approximate (Q430841): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q87
@@ Property / Mathematics Subject Classification ID: 68Q87 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B05
@@ Property / Mathematics Subject Classification ID: 94B05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B65
@@ Property / Mathematics Subject Classification ID: 94B65 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6050362
@@ Property / zbMATH DE Number: 6050362 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+random polynomials
@@ Property / zbMATH Keywords: random polynomials / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Reed-Muller codes
@@ Property / zbMATH Keywords: Reed-Muller codes / 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-011-0020-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2032742263
@@ Property / OpenAlex ID: W2032742263 / rank @@
+Normal rank
@@ Property / cites work @@
+On the density of sets of vectors
@@ Property / cites work: On the density of sets of vectors / rank @@
+Normal rank
@@ Property / cites work @@
+Small Sample Spaces Cannot Fool Low Degree Polynomials
+Normal rank
@@ Property / cites work @@
+Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
+Normal rank
@@ Property / cites work @@
+Affine dispersers from subspace polynomials
@@ Property / cites work: Affine dispersers from subspace polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q4342497
@@ Property / cites work: Q4342497 / rank @@
+Normal rank
@@ Property / cites work @@
+On the trace of finite sets
@@ Property / cites work: On the trace of finite sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549710
@@ Property / cites work: Q3549710 / rank @@
+Normal rank
@@ Property / cites work @@
+A new proof of Szemerédi's theorem
@@ Property / cites work: A new proof of Szemerédi's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255576
@@ Property / cites work: Q4255576 / rank @@
+Normal rank
@@ Property / cites work @@
+On the weight structure of Reed-Muller codes
@@ Property / cites work: On the weight structure of Reed-Muller codes / rank @@
+Normal rank
@@ Property / cites work @@
+On the weight enumeration of weights less than 2.5d of Reed—Muller codes
+Normal rank
@@ Property / cites work @@
+Weight Distribution and List-Decoding Size of Reed–Muller Codes
+Normal rank
@@ Property / cites work @@
+Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / 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:430841