Abstract:
An asymptotics for the complexity of implementation of Boolean functions taking the unit value on a comparatively small set of collections of variables by self-correcting contact networks is obtained.
Key words:Boolean functions, contact networks, self-correcting schemes, complexity of implementation of functions.