Pulse Entdecken nav.journalClub Debatten Trends Forschende Zeitschriften

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

Start Entdecken nav.journalClub Trends

⌘+K

The knowledge complexity of interactive proof-systems | Synapse

January 1, 1985Open Access

Die Wissenskomplexität interaktiver Beweissysteme

SGSbafi GoldwasserMIT University SMSilvio MicaliAkamai (United States)CRCharles RackoffUniversity of Toronto

Key Points

Key points are not available for this paper at this time.

Abstract

Wie viel Wissen sollte kommuniziert werden, um einen Satz T zu beweisen?

KI fragen

Like

Bookmark

Share

View Full Paper

Cite This Study

Goldwasser et al. (Tue,) untersuchten diese Frage.

synapsesocial.com/papers/69dd6e56629747396240cfcb https://doi.org/https://doi.org/10.1145/22145.22178

KI fragen

Like

Bookmark

Share

View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Some complexity questions related to distributive computing(Preliminary Report)1979 · 1,067 citations
2Trading group theory for randomness1985 · 783 citations
3Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values)2005 · 31 citations
4A logic to reason about likelihood1983 · 33 citations
5The complexity of theorem-proving procedures1971 · 6,187 citations