Volume 18, No 6, 2011, P. 71-81
E. A. Okolnishnikova
On distributed circuits
The class of distributed circuits is introduced. These circuits simulate the computation by distributed memory machines. Some bounds on the complexity of computation for Boolean functions and systems of Boolean functions are proved.
Keywords: computation complexity, combinatorial circuit, computation simulation.
Okolnishnikova Elizaveta Antonovna 1
1. S. L. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia