Completeness theorems for non-cryptographic fault-tolerant distributed computation.

2019

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

Keywords:

References

Citations