Publication | Open Access
Completeness theorems for non-cryptographic fault-tolerant distributed computation
2.5K
Citations
12
References
1988
Year
Unknown Venue
Circuit ComplexityComputational Complexity TheoryN ProcessorsEngineeringDistributed AlgorithmsN InputsHardware AlgorithmComputer ArchitectureComputational ComplexityFault ToleranceFormal VerificationByzantine FaultParallel Complexity TheoryParallel ComputingComputer EngineeringComplete NetworkComputer ScienceNeural Architecture SearchFormal MethodsParallel Programming
Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that:
| Year | Citations | |
|---|---|---|
Page 1
Page 1