Michael Ben-Or, Avi Wigderson
Abstract
Open-access reader
Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that:
OpenAlex reports 2539 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that:
Key concepts: Computer science, Cryptography, Completeness (order theory), Cryptographic primitive, Computation, Fault tolerance, Theoretical computer science, Cryptographic protocol