Three-Player Entangled XOR Games are NP-Hard to Approximate (Q2816299): Difference between revisions

@@ Property / OpenAlex ID @@
+W2466331000
@@ Property / OpenAlex ID: W2466331000 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59792576
@@ Property / Wikidata QID: Q59792576 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1242
@@ Property / arXiv ID: 1302.1242 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Q4527016
@@ Property / cites work: Q4527016 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Non-deterministic exponential time has two-prover interactive protocols
+Normal rank
@@ Property / cites work @@
+Efficient probabilistically checkable proofs and applications to approximations
+Normal rank
@@ Property / cites work @@
+Free Bits, PCPs, and Nonapproximability---Towards Tight Results
+Normal rank
@@ Property / cites work @@
+Quantum de finetti theorems under local measurements with applications
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+Normal rank
@@ Property / cites work @@
+Proposed Experiment to Test Local Hidden-Variable Theories
+Normal rank
@@ Property / cites work @@
+Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
+Normal rank
@@ Property / cites work @@
+PCP characterizations of NP: toward a polynomially-small error-probability
+Normal rank
@@ Property / cites work @@
+A parallel repetition theorem for entangled projection games
+Normal rank
@@ Property / cites work @@
+Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
+Normal rank
@@ Property / cites work @@
+Interactive proofs and the hardness of approximating cliques
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of interactive proof-systems
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Entangled Games Are Hard to Approximate
@@ Property / cites work: Entangled Games Are Hard to Approximate / rank @@
+Normal rank
@@ Property / cites work @@
+Unique Games with Entangled Provers Are Easy
@@ Property / cites work: Unique Games with Entangled Provers Are Easy / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel repetition of entangled games
@@ Property / cites work: Parallel repetition of entangled games / rank @@
+Normal rank
@@ Property / cites work @@
+Sub-Constant Error Low Degree Test of Almost-Linear Size
+Normal rank
@@ Property / cites work @@
+Sub-constant error probabilistically checkable proof of almost-linear size
+Normal rank
@@ Property / cites work @@
+Q4431278
@@ Property / cites work: Q4431278 / rank @@
+Normal rank
@@ Property / cites work @@
+A Parallel Repetition Theorem
@@ Property / cites work: A Parallel Repetition Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Probabilistic Algorithms for Verification of Polynomial Identities
+Normal rank
@@ Property / cites work @@
+Delegation for bounded space
@@ Property / cites work: Delegation for bounded space / rank @@
+Normal rank
@@ Property / cites work @@
+Q3851616
@@ Property / cites work: Q3851616 / rank @@
+Normal rank