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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Automatic control and computer sciences Jg. 51; H. 5; S. 285 - 293
1. Verfasser:	Suprun, V. P.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.09.2017 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!