Complexity of problems of minimization of polynomials in Boolean variables
Diskretnyj analiz i issledovanie operacij, no. 23 (1983), pp. 3-11.

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

@article{DA_1983_23_a0,
     author = {A. A. Ageev},
     title = {Complexity of problems of minimization of polynomials in {Boolean} variables},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--11},
     publisher = {mathdoc},
     number = {23},
     year = {1983},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1983_23_a0/}
}
TY  - JOUR
AU  - A. A. Ageev
TI  - Complexity of problems of minimization of polynomials in Boolean variables
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1983
SP  - 3
EP  - 11
IS  - 23
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1983_23_a0/
LA  - ru
ID  - DA_1983_23_a0
ER  - 
%0 Journal Article
%A A. A. Ageev
%T Complexity of problems of minimization of polynomials in Boolean variables
%J Diskretnyj analiz i issledovanie operacij
%D 1983
%P 3-11
%N 23
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1983_23_a0/
%G ru
%F DA_1983_23_a0
A. A. Ageev. Complexity of problems of minimization of polynomials in Boolean variables. Diskretnyj analiz i issledovanie operacij, no. 23 (1983), pp. 3-11. http://geodesic.mathdoc.fr/item/DA_1983_23_a0/