This article is cited in 2 papers

INFORMATION AND COMPUTATION TECHNOLOGIES

Machine resolving of discrete mathematics problems

A. P. Goryushkin<sup>ab

a</sup> 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.

UDC: 519.71

MSC: 03G05

Received: 05.11.2011

DOI: 10.18454/2079-6641-2011-3-2-58-68

Bibliographic databases:

•