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
Menu
Mendeley
Endnote
Computational bound on complexity of polynomial represen- tations of boolean functions
2010
Journal:  
The Bulletin of Irkutsk State University Series Mathematics
Author:  
Abstract:

This paper concerns complexity of exclusive-or-sum-of-products expressions representing Boolean functions. Conditions for functions having complexity over a given number are introduced. Genetic minimization algorithm gave obtained upper bounds on complexity of such functions. As a result a new upper bound on complexity for all Boolean functions is obtained.

Keywords:

Citation Owners
Information: There is no ciation to this publication.
Similar Articles
1. On Complexity of a Particular Boolean Functions Class
2010


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


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


  Details
 Download PDF
4. On Complexity of Standard Forms for Multifunctions
2017


  Details
 Download PDF
5. Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms
2019


  Details
 Download PDF
6. On Length of Boolean Functions of a Small Number of Variables in the Class of Pseudo-Polynomials
2020


  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