Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2015, Volume 27, Issue 1, Pages 73–97
DOI: https://doi.org/10.4213/dm1316 (Mi dm1316) 		 
Complexity of implementation of parity functions in the implication–negation basis

Yu. A. Kombarov

Lomonosov Moscow State University
Full-text PDF (712 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1316
Abstract: The paper is concerned with circuits in the basis $\{x \to y, \overline{x}\}$. The exact value of the complexity of implementation of an even parity function is obtained and the minimal circuits implementing an odd parity function are described.
Keywords: circuit, parity function, minimal circuit, complexity circuits.
Funding agency Grant number
Russian Foundation for Basic Research 14-01-00598
Received: 17.09.2014
English version:
Discrete Mathematics and Applications, 2015, Volume 25, Issue 4, Pages 211–231
DOI: https://doi.org/10.1515/dma-2015-0021
Bibliographic databases:
Document Type: Article
UDC: 519.714.4
Language: Russian
Citation: Yu. A. Kombarov, “Complexity of implementation of parity functions in the implication–negation basis”, Diskr. Mat., 27:1 (2015), 73–97; Discrete Math. Appl., 25:4 (2015), 211–231
Citation in format AMSBIB
\Bibitem{Kom15}
\by Yu.~A.~Kombarov
\paper Complexity of implementation of parity functions in the implication--negation basis
\jour Diskr. Mat.
\yr 2015
\vol 27
\issue 1
\pages 73--97
\mathnet{http://mi.mathnet.ru/dm1316}
\crossref{https://doi.org/10.4213/dm1316}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3468142}
\elib{https://elibrary.ru/item.asp?id=23780137}
\transl
\jour Discrete Math. Appl.
\yr 2015
\vol 25
\issue 4
\pages 211--231
\crossref{https://doi.org/10.1515/dma-2015-0021}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000366854600004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84939142713}
Linking options:
  • https://www.mathnet.ru/eng/dm1316
  • https://doi.org/10.4213/dm1316
  • https://www.mathnet.ru/eng/dm/v27/i1/p73
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:409
    Full-text PDF :168
    References:32
    First page:36
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024