|
Problemy Peredachi Informatsii, 1978, Volume 14, Issue 1, Pages 90–100
(Mi ppi1524)
|
|
|
|
Automata Theory
Estimates of Information Cost of Computing Boolean Functions in Combination Circuits
A. P. Goryashko, A. S. Nemirovskii
Abstract:
A new measure of the complexity of Boolean functions is introduced, this being defined by the quantity of information transmitted over all the channels of a circuit that computes a Boolean vector-valued function. Upper and lower bounds for this complexity measure are obtained.
Received: 01.03.1976
Citation:
A. P. Goryashko, A. S. Nemirovskii, “Estimates of Information Cost of Computing Boolean Functions in Combination Circuits”, Probl. Peredachi Inf., 14:1 (1978), 90–100; Problems Inform. Transmission, 14:1 (1978), 63–70
Linking options:
https://www.mathnet.ru/eng/ppi1524 https://www.mathnet.ru/eng/ppi/v14/i1/p90
|
|