Automata

Complexity on implementing symmetric and partly symmetric functions in iterative networks

A. Ya. Makarevskii, L. B. Shipilina

Moscow

Abstract: The behaviour of implementation complexity functions is studied for symmetrical and partly symmetrical functions at $n \to\infty$ where $n$ is the number of the function variables.

UDC: 62-501


Received: 29.01.1973

 English version: Automation and Remote Control, 1974, 35:2, 272–279

Bibliographic databases:

• 
•