Geodesic
Efficient algorithms for construction of general solution graph for systems of Boolean equations
Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 5 (2002), pp. 227-234.

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

@article{TDM_2002_5_a14,
     author = {V. G. Smirnov},
     title = {Efficient algorithms for construction of general solution graph for systems of {Boolean} equations},
     journal = {Trudy po diskretnoj matematike},
     pages = {227--234},
     publisher = {mathdoc},
     volume = {5},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TDM_2002_5_a14/}
}
TY  - JOUR
AU  - V. G. Smirnov
TI  - Efficient algorithms for construction of general solution graph for systems of Boolean equations
JO  - Trudy po diskretnoj matematike
PY  - 2002
SP  - 227
EP  - 234
VL  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TDM_2002_5_a14/
LA  - ru
ID  - TDM_2002_5_a14
ER  - 
%0 Journal Article
%A V. G. Smirnov
%T Efficient algorithms for construction of general solution graph for systems of Boolean equations
%J Trudy po diskretnoj matematike
%D 2002
%P 227-234
%V 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TDM_2002_5_a14/
%G ru
%F TDM_2002_5_a14
V. G. Smirnov. Efficient algorithms for construction of general solution graph for systems of Boolean equations. Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 5 (2002), pp. 227-234. http://geodesic.mathdoc.fr/item/TDM_2002_5_a14/