Geodesic
On complexity of Boolean function minimization
Doklady Akademii Nauk, Tome 198 (1971) no. 1, pp. 35-38.

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

@article{DAN_1971_198_1_a7,
     author = {M. I. Kanovitch},
     title = {On complexity of {Boolean} function minimization},
     journal = {Doklady Akademii Nauk},
     pages = {35--38},
     publisher = {mathdoc},
     volume = {198},
     number = {1},
     year = {1971},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1971_198_1_a7/}
}
TY  - JOUR
AU  - M. I. Kanovitch
TI  - On complexity of Boolean function minimization
JO  - Doklady Akademii Nauk
PY  - 1971
SP  - 35
EP  - 38
VL  - 198
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1971_198_1_a7/
LA  - ru
ID  - DAN_1971_198_1_a7
ER  - 
%0 Journal Article
%A M. I. Kanovitch
%T On complexity of Boolean function minimization
%J Doklady Akademii Nauk
%D 1971
%P 35-38
%V 198
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1971_198_1_a7/
%G ru
%F DAN_1971_198_1_a7
M. I. Kanovitch. On complexity of Boolean function minimization. Doklady Akademii Nauk, Tome 198 (1971) no. 1, pp. 35-38. http://geodesic.mathdoc.fr/item/DAN_1971_198_1_a7/