RUS
ENG
Full version
JOURNALS
// Avtomatika i Telemekhanika
// Archive
Avtomat. i Telemekh.,
1987
Issue 1,
Pages
135–150
(Mi at4364)
Automata
Estimation of the program implementation complexity with various forms of boolean functions
L. Ya. Lapkin
Leningrad
Abstract:
The complexity of program impementation is discussed for various forms of Boolean functions and implementation methods such as binary,
$k$
-nary, and matrix-decision programs.
UDC:
681.306:512.932
Received:
14.06.1985
Fulltext:
PDF file (2290 kB)
©
Steklov Math. Inst. of RAS
, 2024