Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)

Michael Ben-Or, Shafi Goldwasser, Avi Wigderson

1988 · 485 citations · 0 references

Concepts

Abstract

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