МАШИННОЕ РЕШЕНИЕ ЗАДАЧ ДИСКРЕТНОЙ МАТЕМАТИКИ

А.П. Горюшкин & A.P. Goryushkin
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.