On the advantage over a random assignment (Q5894908): Difference between revisions

@@ Property / Wikidata QID @@
+Q56958935
@@ Property / Wikidata QID: Q56958935 / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomized graph products
@@ Property / cites work: Derandomized graph products / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms with large domination ratio
@@ Property / cites work: Algorithms with large domination ratio / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Inequalities in Fourier analysis
@@ Property / cites work: Inequalities in Fourier analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Free Bits, PCPs, and Nonapproximability---Towards Tight Results
+Normal rank
@@ Property / cites work @@
+The complexity of approximating a nonlinear program
+Normal rank
@@ Property / cites work @@
+Noise-tolerant learning, the parity problem, and the statistical query model
+Normal rank
@@ Property / cites work @@
+Towards optimal lower bounds for clique and chromatic number.
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+A Parallel Repetition Theorem
@@ Property / cites work: A Parallel Repetition Theorem / rank @@
+Normal rank