Geodesic
Computational complexity of Boolean functions
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 67 (2012) no. 1, pp. 93-165

Voir la notice de l'article provenant de la source Math-Net.Ru

Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching. Bibliography: 165 titles.
Keywords: basis, Boolean circuits, Boolean function, depth and delay of a Boolean circuit, disjunctive normal form, invariant classes of Boolean functions, contact network without zero chains, logical formulae, lower bounds for the complexity of circuits, series-parallel contact network, symmetric Boolean function, complexity of a circuit, partial Boolean function.
Mots-clés : cellular circuits 
@article{RM_2012_67_1_a1,
     author = {A. D. Korshunov},
     title = {Computational complexity of {Boolean} functions},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {93--165},
     publisher = {mathdoc},
     volume = {67},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_2012_67_1_a1/}
}
TY  - JOUR
AU  - A. D. Korshunov
TI  - Computational complexity of Boolean functions
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2012
SP  - 93
EP  - 165
VL  - 67
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/RM_2012_67_1_a1/
LA  - en
ID  - RM_2012_67_1_a1
ER  - 
%0 Journal Article
%A A. D. Korshunov
%T Computational complexity of Boolean functions
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2012
%P 93-165
%V 67
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/RM_2012_67_1_a1/
%G en
%F RM_2012_67_1_a1
A. D. Korshunov. Computational complexity of Boolean functions. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 67 (2012) no. 1, pp. 93-165. http://geodesic.mathdoc.fr/item/RM_2012_67_1_a1/