RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 1989 Volume 1, Issue 4, Pages 36–45 (Mi dm939)

This article is cited in 4 papers

The complexity of realizing partial Boolean functions by schemes consisting of functional elements

A. E. Andreev


UDC: 519.7

Received: 27.12.1988


 English version:
Discrete Mathematics and Applications, 1991, 1:3, 251–261

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025