Bounded-depth circuits cannot sample good codes (Q692999): Difference between revisions

@@ Property / cites work @@
+The Quantum Communication Complexity of Sampling
@@ Property / cites work: The Quantum Communication Complexity of Sampling / rank @@
+Normal rank
@@ Property / cites work @@
+Polylogarithmic Independence Can Fool DNF Formulas
+Normal rank
@@ Property / cites work @@
+The average sensitivity of bounded-depth circuits
@@ Property / cites work: The average sensitivity of bounded-depth circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Polylogarithmic independence fools             <i>AC</i>             <sup>0</sup>             circuits
+Normal rank
@@ Property / cites work @@
+The cell probe complexity of succinct data structures
+Normal rank
@@ Property / cites work @@
+On the Implementation of Huge Random Objects
@@ Property / cites work: On the Implementation of Huge Random Objects / rank @@
+Normal rank
@@ Property / cites work @@
+Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
+Normal rank
@@ Property / cites work @@
+Optimal Assignments of Numbers to Vertices
@@ Property / cites work: Optimal Assignments of Numbers to Vertices / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the edges of the n-cube
@@ Property / cites work: A note on the edges of the n-cube / rank @@
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Constant depth circuits, Fourier transform, and learnability
+Normal rank
@@ Property / cites work @@
+Bounded-depth circuits cannot sample good codes
@@ Property / cites work: Bounded-depth circuits cannot sample good codes / rank @@
+Normal rank
@@ Property / cites work @@
+On the cell probe complexity of polynomial evaluation
+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 @@
+A Simple Proof of Bazzi’s Theorem
@@ Property / cites work: A Simple Proof of Bazzi’s Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of constructing pseudorandom generators from hard functions
+Normal rank
@@ Property / cites work @@
+The Complexity of Distributions
@@ Property / cites work: The Complexity of Distributions / rank @@
+Normal rank
@@ Property / cites work @@
+Extractors for Circuit Sources
@@ Property / cites work: Extractors for Circuit Sources / rank @@
+Normal rank