Affordable Access

Access to the full text

Complexity of boolean functions in a class of canonical polarized polynomials

Authors
  • Alekseichuck, A. N.1
  • 1 Military Institute of Control and Communication, Kiev, Ukraine , Kiev
Type
Published Article
Journal
Cybernetics and Systems Analysis
Publisher
Springer US
Publication Date
May 01, 2000
Volume
36
Issue
3
Pages
468–471
Identifiers
DOI: 10.1007/BF02733001
Source
Springer Nature
Keywords
License
Yellow

Abstract

Relationships for the maximum of a minimal number of summands among all canonical polarized polynomials of a Boolean function are obtained.

Report this publication

Statistics

Seen <100 times