Russian Mathematical Surveys
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Uspekhi Mat. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Russian Mathematical Surveys, 2012, Volume 67, Issue 1, Pages 93–165
DOI: https://doi.org/10.1070/RM2012v067n01ABEH004777 (Mi rm9459) 		 
This article is cited in 7 scientific papers (total in 7 papers)

Computational complexity of Boolean functions

A. D. Korshunov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
English version PDF (978 kB) Citations (7) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/RM2012v067n01ABEH004777
Abstract: Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching.
Bibliography: 165 titles.
Keywords: basis, Boolean circuits, Boolean function, depth and delay of a Boolean circuit, disjunctive normal form, invariant classes of Boolean functions, cellular circuits, contact network without zero chains, logical formulae, lower bounds for the complexity of circuits, series-parallel contact network, symmetric Boolean function, complexity of a circuit, partial Boolean function.
Received: 04.10.2011
Bibliographic databases:
Document Type: Article
UDC: 519.95+519.7
MSC: Primary 06E30, 68Q30, 94C10; Secondary 06E99
Language: English
Original paper language: Russian
Citation: A. D. Korshunov, “Computational complexity of Boolean functions”, Russian Math. Surveys, 67:1 (2012), 93–165
Citation in format AMSBIB
\Bibitem{Kor12}
\by A.~D.~Korshunov
\paper Computational complexity of Boolean functions
\jour Russian Math. Surveys
\yr 2012
\vol 67
\issue 1
\pages 93--165
\mathnet{http://mi.mathnet.ru//eng/rm9459}
\crossref{https://doi.org/10.1070/RM2012v067n01ABEH004777}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2961468}
\zmath{https://zbmath.org/?q=an:1257.94041}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2012RuMaS..67...93K}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000303447100002}
\elib{https://elibrary.ru/item.asp?id=20423434}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84860872148}
Linking options:
  • https://www.mathnet.ru/eng/rm9459
  • https://doi.org/10.1070/RM2012v067n01ABEH004777
  • https://www.mathnet.ru/eng/rm/v67/i1/p97
    Remarks
    This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Успехи математических наук Russian Mathematical Surveys
    Statistics & downloads:
    Abstract page:1787
    Russian version PDF:2347
    English version PDF:80
    References:148
    First page:76
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024