User Guide
Why can I only view 3 results?
You can also view all results when you are connected from the network of member institutions only. For non-member institutions, we are opening a 1-month free trial version if institution officials apply.
So many results that aren't mine?
References in many bibliographies are sometimes referred to as "Surname, I", so the citations of academics whose Surname and initials are the same may occasionally interfere. This problem is often the case with citation indexes all over the world.
How can I see only citations to my article?
After searching the name of your article, you can see the references to the article you selected as soon as you click on the details section.
Institutional References Quartile Statistics FAQ User Guide Contact us
Institutional Application Application for Journals
Türkçe English
 Views 5
 Downloands 1
Menu
Mendeley
Endnote
On Complexity of a Particular Boolean Functions Class
2010
Journal:  
The Bulletin of Irkutsk State University Series Mathematics
Author:  
Abstract:

This paper concerns complexity of polynomial forms (exor-sum-of-pro-ducts) 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:

Citation Owners
Information: There is no ciation to this publication.
Similar Articles
1. On Length of Boolean Functions of a Small Number of Variables in the Class of Pseudo-Polynomials
2020


  Details
 Download PDF
2. The Complexity of the Representation of Multiple-Output Boolean Functions
2016


  Details
 Download PDF
3. Computational bound on complexity of polynomial represen- tations of boolean functions
2010


  Details
 Download PDF
4. Lower Bound of the Complexity of Functions over Finite Field of Order 4 in the Class of Polarized Polynomials
2016


  Details
 Download PDF
5. Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
2017


  Details
 Download PDF
6. An Algorithm for Minimization of Boolean Functions in the Class of Toffoli Reversible Logic Circuits
2018


  Details
 Download PDF
The Bulletin of Irkutsk State University Series Mathematics

Field :   Fen Bilimleri ve Matematik

Journal Type :   Uluslararası

Metrics
Article : 601
Cite : 1
Details
The Bulletin of Irkutsk State University Series Mathematics