RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper.,
1995
Volume 2,
Issue 1,
Pages
7–20
(Mi da451)
This article is cited in
5
papers
On the complexity of the realization of Boolean functions by circuits in an infinite basis
O. M. Kasim-zade
M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
UDC:
519.6
Received:
22.11.1994
Fulltext:
PDF file (1254 kB)
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2025