Concepedia

Publication | Closed Access

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

484

Citations

0

References

1988

Year

Michael Ben-Or, Shafi Goldwasser, Avi Wigderson

Unknown Venue

Abstract

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