Bulletin of Irkutsk State University. Series Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Bulletin of Irkutsk State University. Series Mathematics:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Bulletin of Irkutsk State University. Series Mathematics, 2010, Volume 3, Issue 4, Pages 33–43 (Mi iigum174)  
This article is cited in 1 scientific paper (total in 1 paper)

Computational bound on complexity of polynomial representations of Boolean functions

A. S. Kazimirov, S. Yu. Reymerov

East Siberian State Academy of Education, 6, N. Naberezhnaya St., Irkutsk, 664011
Full-text PDF (368 kB) Citations (1)
References:
PDF
HTML
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: boolean functions; ESOPs; exclusive-or-sum-of-products; minimization; genetic algorithms.
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. S. Kazimirov, S. Yu. Reymerov, “Computational bound on complexity of polynomial representations of Boolean functions”, Bulletin of Irkutsk State University. Series Mathematics, 3:4 (2010), 33–43
Citation in format AMSBIB
\Bibitem{KazRey10}
\by A.~S.~Kazimirov, S.~Yu.~Reymerov
\paper Computational bound on complexity of polynomial representations of Boolean functions
\jour Bulletin of Irkutsk State University. Series Mathematics
\yr 2010
\vol 3
\issue 4
\pages 33--43
\mathnet{http://mi.mathnet.ru/iigum174}
\zmath{https://zbmath.org/?q=an:1271.94038}
\elib{https://elibrary.ru/item.asp?id=15540112}
Linking options:
  • https://www.mathnet.ru/eng/iigum174
  • https://www.mathnet.ru/eng/iigum/v3/i4/p33
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:195
    Full-text PDF :88
    References:44
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024