RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2011 Volume 18, Issue 6, Pages 71–81 (Mi da671)

On distributed circuits

E. A. Okolnishnikova


Abstract: 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. Bibliogr. 10.

Keywords: computation complexity, combinatorial circuit, computation simulation.

UDC: 519.8

Received: 03.12.2010



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026