Geodesic
An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 1, pp. 3-11

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

@article{DA_2005_12_1_a0,
     author = {V. L. Beresnev},
     title = {An efficient algorithm for solving the problem of minimizing polynomials in {Boolean} variables with the connectedness property},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--11},
     publisher = {mathdoc},
     volume = {12},
     number = {1},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2005_12_1_a0/}
}
TY  - JOUR
AU  - V. L. Beresnev
TI  - An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2005
SP  - 3
EP  - 11
VL  - 12
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2005_12_1_a0/
LA  - ru
ID  - DA_2005_12_1_a0
ER  - 
%0 Journal Article
%A V. L. Beresnev
%T An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
%J Diskretnyj analiz i issledovanie operacij
%D 2005
%P 3-11
%V 12
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2005_12_1_a0/
%G ru
%F DA_2005_12_1_a0
V. L. Beresnev. An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property. Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 1, pp. 3-11. http://geodesic.mathdoc.fr/item/DA_2005_12_1_a0/