The complexity of Boolean functions in the Reed–Muller polynomials class

This paper considers the problem of transforametion of Boolean functions into canonical polarized polynomials (Reed–Muller polynomials). Two Shannon functions are introduced to estimate the complexity of Boolean functions in the polynomials class under consideration. We propose three Boolean functio...

Full description

Saved in:

Bibliographic Details
Published in:	Automatic control and computer sciences Vol. 51; no. 5; pp. 285 - 293
Main Author:	Suprun, V. P.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.09.2017 Springer Nature B.V
Subjects:	Boolean algebra Boolean functions Codes Complexity Computer Science Control Structures and Microprogramming Functions (mathematics) Mathematical analysis Polynomials polynomial complexity Reed–Muller polynomial Zhegalkin polynomial symmetric Boolean function triangle method logical scheme Boolean function Shannon functions Boolean derivative
ISSN:	0146-4116, 1558-108X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!