Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2015, Volume 22, Issue 3, Pages 75–97
DOI: https://doi.org/10.17377/daio.2015.22.471 (Mi da820) 		 
This article is cited in 2 scientific papers (total in 2 papers)

On the problem of minimizing a single set of Boolean functions

I. P. Chukhrov

Institute of Computer Aided Design RAS, 19/18 2-nd Brestskaya St., 123056 Moscow, Russia
Full-text PDF (495 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2015.22.471
Abstract: We study the set of Boolean functions that consist of a single connected component, have minimal complexes of faces which are not shortest and do not satisfy the sufficient condition for minimality based on the notion of an independent set of vertices. The independent minimization for the connected components and feasibility of sufficient conditions for the minimality can not be applied to minimizing of such functions. For this set of functions, we obtain lower bounds on the power and maximal number of complexes of faces which are minimal with respect to additive measures of linear and polynomial complexity. Ill. 1, bibliogr. 8.
Keywords: Boolean function, unit cube, face, complex of faces, additive complexity measure, shortest complex of faces, minimal complex of faces.
Received: 16.01.2015
English version:
Journal of Applied and Industrial Mathematics, 2015, Volume 9, Issue 3, Pages 335–350
DOI: https://doi.org/10.1134/S1990478915030059
Bibliographic databases:
Document Type: Article
UDC: 519.714.7
Language: Russian
Citation: I. P. Chukhrov, “On the problem of minimizing a single set of Boolean functions”, Diskretn. Anal. Issled. Oper., 22:3 (2015), 75–97; J. Appl. Industr. Math., 9:3 (2015), 335–350
Citation in format AMSBIB
\Bibitem{Chu15}
\by I.~P.~Chukhrov
\paper On the problem of minimizing a~single set of Boolean functions
\jour Diskretn. Anal. Issled. Oper.
\yr 2015
\vol 22
\issue 3
\pages 75--97
\mathnet{http://mi.mathnet.ru/da820}
\crossref{https://doi.org/10.17377/daio.2015.22.471}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3443299}
\elib{https://elibrary.ru/item.asp?id=23859893}
\transl
\jour J. Appl. Industr. Math.
\yr 2015
\vol 9
\issue 3
\pages 335--350
\crossref{https://doi.org/10.1134/S1990478915030059}
Linking options:
  • https://www.mathnet.ru/eng/da820
  • https://www.mathnet.ru/eng/da/v22/i3/p75
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:259
    Full-text PDF :58
    References:41
    First page:11
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024