Journal article · 2026 · Open access
Near Optimal Alphabet-Soundness Tradeoff PCPs
Journal of the ACM, 73(4), 1–98 · Published 25 May 2026 · DOI 10.1145/3816427
In brief
“Near Optimal Alphabet-Soundness Tradeoff PCPs” is a 2026 journal article by Dor Minzer and Kai Zheng, published in Journal of the ACM. OpenAlex counts 3 citations as of 17 November 2026. It is open access under a CC BY licence: the full text is free to read at Journal of the ACM.
- Citations
- 3
- Most cited in
- 2024 (1)
- Field-weighted impact
- 1.66
- References
- 49
- Authors
- 2
Abstract
We show that for all ɛ > 0, for sufficiently large q ∈ ℕ that is a power of 2, for all δ > 0, it is NP-hard to distinguish whether a given 2-Prover-1-Round projection game with alphabet size q has value at least 1-δ, or value at most 1/ q 1-ɛ . This establishes a nearly optimal alphabet-to-soundness tradeoff for 2-query PCPs with alphabet size q , improving upon a result of [Chan, J. ACM 2016]. Our result has the following implications: (1) Near optimal hardness for Quadratic Programming: it is NP-hard to approximate the value of a given Boolean Quadratic Program within factor (log n ) 1 - o (1) under quasi-polynomial time reductions. This improves upon a result of [Khot, Safra, ToC 2013] and nearly matches the performance of the best known algorithms due to [Megretski, IWOTA 2000], [Nemirovski, Roos, Terlaky, Mathematical Programming 1999] and [Charikar, Wirth, FOCS 2004] that achieve O (log n ) approximation ratio. (2) Bounded degree 2-CSPs: under randomized reductions, for sufficiently large d > 0, it is NP-hard to approximate the value of 2-CSPs in which each variable appears in at most d constraints to within a factor of (1- o (1)) \(\frac{d}{2}\) , improving upon a result of [Lee, Manurangsi, ITCS 2024]. (3) Improved hardness results for connectivity problems: using results of [Laekhanukit, SODA 2014] and [Manurangsi, Inf. Process. Lett., 2019], we deduce improved hardness results for the Rooted k -Connectivity Problem, the Vertex-Connectivity Survivable Network Design Problem and the Vertex-Connectivity k -Route Cut Problem.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Minzer, D., & Zheng, K. (2026). Near Optimal Alphabet-Soundness Tradeoff PCPs. Journal of the ACM, 73(4), 1–98. https://doi.org/10.1145/3816427
MLA 9
Minzer, Dor, and Kai Zheng. “Near Optimal Alphabet-Soundness Tradeoff PCPs.” Journal of the ACM, vol. 73, no. 4, 2026, pp. 1–98. https://doi.org/10.1145/3816427.
Chicago
Minzer, Dor and Kai Zheng. 2026. “Near Optimal Alphabet-Soundness Tradeoff PCPs.” Journal of the ACM 73 (4): 1–98. https://doi.org/10.1145/3816427.
Harvard
Minzer, D. and Zheng, K. (2026) ‘Near Optimal Alphabet-Soundness Tradeoff PCPs’, Journal of the ACM, 73(4), pp. 1–98. doi:10.1145/3816427.
IEEE
D. Minzer and K. Zheng, “Near Optimal Alphabet-Soundness Tradeoff PCPs,” Journal of the ACM, vol. 73, no. 4, pp. 1–98, 2026, doi: 10.1145/3816427.
BibTeX
@article{minzer2026near,
title = {{Near Optimal Alphabet-Soundness Tradeoff PCPs}},
author = {Minzer, Dor and Zheng, Kai},
journal = {Journal of the ACM},
year = {2026},
volume = {73},
number = {4},
pages = {1--98},
doi = {10.1145/3816427},
url = {https://doi.org/10.1145/3816427}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 1 | |
| 2025 | 1 | |
| 2026 | 1 |
Its field-weighted citation impact is 1.66: it has been cited 1.66 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- probabilistically checkable proofs
- NP-hardness
- quadratic programming
- connectivity problems
- hardness of approximation
- randomized reductions
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Minzer, D., & Zheng, K. (2026). Near Optimal Alphabet-Soundness Tradeoff PCPs. Journal of the ACM, 73(4), 1–98. https://doi.org/10.1145/3816427
How many times has this paper been cited?
3 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Journal of the ACM: sign in and open the full text from this page.
Who wrote this paper?
Dor Minzer, Kai Zheng.
What is the DOI of this paper?
10.1145/3816427, permanently at https://doi.org/10.1145/3816427. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.