Modular construction of succinct arguments for QMA via OSP-based interactive protocol plus collapsing-hash communication compression compiler, without LWE.
hub
Probabilistic checking of proofs: A new characterization of NP
4 Pith papers cite this work, alongside 1,167 external citations. Polarity classification is still indexing.
4
Pith papers citing it
1,167
external citations · external index
hub tools
representative citing papers
Approximating the quantum value of tilted XOR games to constant precision is RE-complete, implying binary nonlocal games are RE-hard to approximate.
An FPT-time O(2^k log n)-approximation is given for k-MMSA_3, alongside gap-preserving reductions clarifying inapproximability across the MMSA hierarchy.
Introduces strong sparsification for 1-in-3-SAT by merging variables, relying on a sub-quadratic vector-set bound derived from the Polynomial Freiman-Ruzsa Theorem, with an application to hypergraph coloring approximation.
citing papers explorer
-
A Modular Approach to Succinct Arguments for QMA
Modular construction of succinct arguments for QMA via OSP-based interactive protocol plus collapsing-hash communication compression compiler, without LWE.
-
XOR Games at Full Tilt: The Hardness of Binary Nonlocal Games
Approximating the quantum value of tilted XOR games to constant precision is RE-complete, implying binary nonlocal games are RE-hard to approximate.
-
On the Approximability of Parameterized Minimum Monotone Satisfying Assignment
An FPT-time O(2^k log n)-approximation is given for k-MMSA_3, alongside gap-preserving reductions clarifying inapproximability across the MMSA hierarchy.
-
Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
Introduces strong sparsification for 1-in-3-SAT by merging variables, relying on a sub-quadratic vector-set bound derived from the Polynomial Freiman-Ruzsa Theorem, with an application to hypergraph coloring approximation.