Machine resolving of discrete mathematics problems
Vestnik KRAUNC. Fiziko-matematičeskie nauki, no. 2 (2011), pp. 58-68
Cet article a éte moissonné depuis la source Math-Net.Ru
This paper discussed problems connected with machine study of Boolean functions and graph algebras. The results of this paper may be used in analysis of the subalgebras structure of the prototypical Boolean algebra and for resolving of graph algebras problems.
Keywords:
Boolean function, functionally complete set, self-dual functions, Zhegalkin polynomial, graph, maximum flow.
@article{VKAM_2011_2_a6,
author = {A. P. Goryushkin},
title = {Machine resolving of discrete mathematics problems},
journal = {Vestnik KRAUNC. Fiziko-matemati\v{c}eskie nauki},
pages = {58--68},
year = {2011},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VKAM_2011_2_a6/}
}
A. P. Goryushkin. Machine resolving of discrete mathematics problems. Vestnik KRAUNC. Fiziko-matematičeskie nauki, no. 2 (2011), pp. 58-68. http://geodesic.mathdoc.fr/item/VKAM_2011_2_a6/