|
This article is cited in 2 scientific papers (total in 2 papers)
INFORMATION AND COMPUTATION TECHNOLOGIES
Machine resolving of discrete mathematics problems
A. P. Goryushkinab a Kamchatka State University by Vitus Bering, 683032, Petropavlovsk Kamchatskiy, Pogranichnaya st, 4, Russia
b Branch of the Far Eastern Federal State University, 683031, Petropavlovsk-Kamchatsky, Tushkanova st., 11 / 1, Russia
Abstract:
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.
Received: 05.11.2011
Citation:
A. P. Goryushkin, “Machine resolving of discrete mathematics problems”, Vestnik KRAUNC. Fiz.-Mat. Nauki, 2011, no. 2(3), 58–68
Linking options:
https://www.mathnet.ru/eng/vkam91 https://www.mathnet.ru/eng/vkam/y2011/i2/p58
|
Statistics & downloads: |
Abstract page: | 184 | Full-text PDF : | 71 | References: | 37 | First page: | 6 |
|