The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Infeasibility of instance compression and succinct PCPs for NP
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Fellows, M. R. (2002) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)00301-9 · Cited by 2,836
Downey, R. G., & Fellows, M. R. (1999) · Monographs in Computer Science · doi:10.1007/978-1-4612-0515-9 · Cited by 2,532
Parameterized Complexity Theory
(2006) · Texts in Theoretical Computer Science. An EATCS Series · doi:10.1007/3-540-29953-x · Cited by 1,869
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
Proof verification and the hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998) · Journal of the ACM · doi:10.1145/278298.278306 · Cited by 1,413
Probabilistic checking of proofs: a new characterization of NP
Arora, S., & Safra, S. (1998) · Journal of the ACM · doi:10.1145/273865.273901 · Cited by 1,153
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
(2023) · doi:10.1145/3564246 · Cited by 587
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
Impagliazzo, R., & Wigderson, A. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258590 · Cited by 534
The PCP theorem by gap amplification
Dinur, I. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132553 · Cited by 501
Two theorems on random polynomial time
Adleman, L. (1978) · 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) · doi:10.1109/sfcs.1978.37 · Cited by 316
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
Mahaney, S. R. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90002-2 · Cited by 299
Parameterized Complexity and Approximation Algorithms
Marx, D. (2007) · The Computer Journal · doi:10.1093/comjnl/bxm048 · Cited by 283
Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
Simon, D. R. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054137 · Cited by 280
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
Klivans, A. R., & van Melkebeek, D. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700389652 · Cited by 270
Conditionally-perfect secrecy and a provably-secure randomized cipher
Maurer, U. M. (1992) · Journal of Cryptology · doi:10.1007/bf00191321 · Cited by 259
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model
Vadhan, S. (2003) · Journal of Cryptology · doi:10.1007/s00145-003-0237-x · Cited by 155
On the Compressibility of NP Instances and Cryptographic Applications
Harnik, D., & Naor, M. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.54 · Cited by 95
On Problems without Polynomial Kernels (Extended Abstract)
Bodlaender, H. L., Downey, R. G., Fellows, M. R., & Hermelin, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70575-8_46 · Cited by 77
Hyper-Encryption and Everlasting Security
Ding, Y. Z., & Rabin, M. O. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45841-7_1 · Cited by 76
Information Theoretically Secure Communication in the Limited Storage Space Model
Aumann, Y., & Rabin, M. O. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1_5 · Cited by 72
Kalai, Y. T., & Raz, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70583-3_44 · Cited by 67
Metadata
- Authors
- Fortnow, L., & Santhanam, R.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2011-01
- Volume
- 77
- Issue
- 1
- Pages
- 91-106
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W1998964055
- Cited by
- 288
- References
- 24
- FWCI
- 31.09
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.