Pulse nav.journalClub Debates activos Tendencias Explorar Investigadores

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

Download on theApp Store

Inicio Explorar nav.journalClub Tendencias

⌘+K

© Synapse Social LLC, 2026

Política de privacidad

Completeness theorems for non-cryptographic fault-tolerant distributed computation | Synapse

January 1, 1988Open Access

Completeness theorems for non-cryptographic fault-tolerant distributed computation

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that:

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo

Cite This Study

Ben-Or et al. (Fri,) studied this question.

synapsesocial.com/papers/6a023e84a9a0df4cf49f456a https://doi.org/https://doi.org/10.1145/62212.62213

Also Consider

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

1Error Correcting Codes1961 · 908 citations
2How to share a secret1979 · 13,463 citations
3Collective Coin Flipping.1989 · 200 citations
4The knowledge complexity of interactive proof-systems2019 · 134 citations
5New directions in cryptography1976 · 14,453 citations