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/

[1] Beresnev V. L., “Algoritmy minimizatsii polinomov ot bulevykh peremennykh”, Problemy kibernetiki, no. 36, Nauka, M., 1979, 225–246 | MR

[2] Beresnev V. L., “Effektivnyi algoritm dlya zadachi razmescheniya proizvodstva s vpolne uravnoveshennoi matritsei”, Diskret. analiz i issled. operatsii. Ser. 1, 5:1 (1998), 20–31 | MR | Zbl

[3] Beresnev V. L., Gimadi E. Kh., Dementev V. T., Ekstremalnye zadachi standartizatsii, Nauka, Novosibirsk, 1978 | MR

[4] Gimadi E. Kh., “Vybor optimalnykh shkal v odnom klasse zadach tipa razmescheniya, unifikatsii i standartizatsii”, Upravlyaemye sistemy, Sb. nauch. tr., no. 6, Institut matematiki SO AN SSSR, Novosibirsk, 1970, 57–70

[5] Hoffman A. J., Kolen A. W. G., Sakarovitch M., “Totally-balanced and greedy matrices”, SIAM J. Algebraic Discrete Methods, 6:4 (1985), 721–730 | DOI | MR | Zbl