Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 43 of the 47 references it cites were found in a registry or an index, and 4 are not checked yet.

Computationally Sound Proofs

Micali, Silvio · 2000 · SIAM Journal on Computing

Abstract

This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a novel and meaningful framework, answers to old and new questions in complexity theory. In particular, given a random oracle or a new complexity assumption, they enable us to prove that verifying is easier than deciding for all theorems; provide a quite effective way to prove membership in computationally hard languages (such as ${\cal C}o$-$\cal N \cal P$-complete ones); and show that every computation possesses a short certificate vouching its correctness. Finally, if a special type of computationally sound proof exists, we show that Blum's notion of program checking can be meaningfully broadened so as to prove that $\cal N \cal P$-complete languages are checkable.

Overview

Integrity signals

Registry

Crossref · 10.1137/s0097539795284959

Cites

43 of 47 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 43 references

Research works printed but not linked: 1

  1. Levin L., 1973, Problems Inform. Transmission, 9, 265

Cited by

See all 493

Metadata

Authors
Micali, S.
Affiliations
Massachusetts Institute of Technology (US)
Corresponding author
Micali, Silvio
Venue
SIAM Journal on Computing
Published
2000-01
Volume
30
Issue
4
Pages
1253-1298
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W1970808997
Cited by
424
References
43
Citations by year
2026: 15 · 2025: 26 · 2024: 22 · 2023: 25 · 2022: 23 · 2021: 20 · 2020: 25 · 2019: 24 · 2018: 25 · 2017: 16 · 2016: 18 · 2015: 19 · 2014: 23 · 2013: 33 · 2012: 24
FWCI
2.69
Type
journal article
Language
en
Open access
closed
Locations
  • SIAM Journal on Computing (publishedVersion)
  • Project Euclid (Cornell University) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
Keywords
interactive proofs, random oracle model, NP-complete languages, program checking

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: Computationally Sound Proofs. https://app.cochat.ai/papers/10.1137/s0097539795284959
The paper
Micali, S. (2000). Computationally Sound Proofs. SIAM Journal on Computing. https://doi.org/10.1137/s0097539795284959

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.