On the derandomization of the graph test for homomorphism over groups (Q2430014): Difference between revisions

@@ Property / cites work @@
+Explicit construction of linear sized tolerant networks
+Normal rank
@@ Property / cites work @@
+\(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials
+Normal rank
@@ Property / cites work @@
+Q4252728
@@ Property / cites work: Q4252728 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+Normal rank
@@ Property / cites work @@
+Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
+Normal rank
@@ Property / cites work @@
+The PCP theorem by gap amplification
@@ Property / cites work: The PCP theorem by gap amplification / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient approximation of product distributions
@@ Property / cites work: Efficient approximation of product distributions / rank @@
+Normal rank
@@ Property / cites work @@
+Simple analysis of graph tests for linearity and PCP
+Normal rank
@@ Property / cites work @@
+Small-Bias Probability Spaces: Efficient Constructions and Applications
+Normal rank
@@ Property / cites work @@
+Constructing Small Sets that are Uniform in Arithmetic Progressions
+Normal rank
@@ Property / cites work @@
+A PCP characterization of NP with optimal amortized query complexity
+Normal rank
@@ Property / cites work @@
+Derandomizing homomorphism testing in general groups
+Normal rank