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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Fundam. Prikl. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Fundam. Prikl. Mat., 2015, Volume 20, Issue 6, Pages 147–153 (Mi fpm1690)  

Complexity and structure of circuits for parity functions

Yu. A. Kombarov

Lomonosov Moscow State University

Abstract: The paper is devoted to circuits implementing parity functions. A review of results establishing exact values of the complexity of parity functions is given. The structure of optimal circuits implementing parity functions is described for some bases. For one infinite basis, an upper bound for the complexity of parity functions is given.

Funding Agency Grant Number
Russian Foundation for Basic Research 14-01-00598_a


Full text: PDF file (154 kB)
References: PDF file   HTML file

English version:
Journal of Mathematical Sciences (New York), 2018, 233:1, 95–99

UDC: 519.95

Citation: Yu. A. Kombarov, “Complexity and structure of circuits for parity functions”, Fundam. Prikl. Mat., 20:6 (2015), 147–153; J. Math. Sci., 233:1 (2018), 95–99

Citation in format AMSBIB
\Bibitem{Kom15}
\by Yu.~A.~Kombarov
\paper Complexity and structure of circuits for parity functions
\jour Fundam. Prikl. Mat.
\yr 2015
\vol 20
\issue 6
\pages 147--153
\mathnet{http://mi.mathnet.ru/fpm1690}
\transl
\jour J. Math. Sci.
\yr 2018
\vol 233
\issue 1
\pages 95--99
\crossref{https://doi.org/10.1007/s10958-018-3926-6}


Linking options:
  • http://mi.mathnet.ru/eng/fpm1690
  • http://mi.mathnet.ru/eng/fpm/v20/i6/p147

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Фундаментальная и прикладная математика
    Number of views:
    This page:127
    Full text:51
    References:21

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020