|
Bulletin of Irkutsk State University. Series Mathematics, 2010, Volume 3, Issue 4, Pages 2–6
(Mi iigum171)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
On complexity of a particular Boolean functions class
S. F. Vinokurov, A. S. Kazimirov East Siberian State Academy of Education, 6, N. Naberezhnaya St., Irkutsk, 664011
Abstract:
This paper concerns complexity of polynomial forms (exor-sum-of-products) representing Boolean functions. Complexity is defined as a minimal number of summands in exor-sum-of-products for a given function. A class of Boolean functions being the most complex among Boolean functions having 6 or less arguments is considered. The exact complexity for functions of described class having 7 agruments is obtained.
Keywords:
boolean function, ESOP, exor-sum-of-products, polynomial, operator, complexity.
Citation:
S. F. Vinokurov, A. S. Kazimirov, “On complexity of a particular Boolean functions class”, Bulletin of Irkutsk State University. Series Mathematics, 3:4 (2010), 2–6
Linking options:
https://www.mathnet.ru/eng/iigum171 https://www.mathnet.ru/eng/iigum/v3/i4/p2
|
Statistics & downloads: |
Abstract page: | 139 | Full-text PDF : | 80 | References: | 25 |
|