Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Consider the following two-player communication process to decide a language L : The first player holds the entire input x but is polynomially bounded; the second player is computationally unbounded but does not know any part of x ; their goal is to decide cooperatively whether x belongs to L at small cost, where the cost measure is the number of bits of communication from the first player to the second player. For any integer d ≥ 3 and positive real ε , we show that, if satisfiability for n -variable d -CNF formulas has a protocol of cost O ( nd − ε ), then coNP is in NP/poly, which implies that the polynomial-time hierarchy collapses to its third level. The result even holds when the first player is conondeterministic, and is tight as there exists a trivial protocol for ε = 0. Under the hypothesis that coNP is not in NP/poly, our result implies tight lower bounds for parameters of interest in several areas, namely sparsification, kernelization in parameterized complexity, lossy compression, and probabilistically checkable proofs. By reduction, similar results hold for other NP-complete problems. For the vertex cover problem on n -vertex d -uniform hypergraphs, this statement holds for any integer d ≥ 2. The case d = 2 implies that no NP-hard vertex deletion problem based on a graph property that is inherited by subgraphs can have kernels consisting of O ( k 2 − ε ) edges unless coNP is in NP/poly, where k denotes the size of the deletion set. Kernels consisting of O ( k 2) edges are known for several problems in the class, including vertex cover, feedback vertex set, and bounded-degree deletion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Improved bound for complexity of matrix multiplication
Davie, A. M., & Stothers, A. J. (2013) · Proceedings of the Royal Society of Edinburgh: Section A Mathematics · doi:10.1017/s0308210511001648 · Cited by 152
Metadata
- Authors
- Dell, H., & Van Melkebeek, D.
- Venue
- Journal of the ACM
- Published
- 2014-07
- Volume
- 61
- Issue
- 4
- Pages
- 1-27
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2034437384
- Cited by
- 159
- References
- 4
- FWCI
- 10.72
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. https://app.cochat.ai/papers/10.1145/2629620
- The paper
- Dell, H., & Van Melkebeek, D. (2014). Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. Journal of the ACM. https://doi.org/10.1145/2629620
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.