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

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


Sibirsk. Zh. Issled. Oper., 1994, Volume 1, Number 4, Pages 33–52 (Mi da499)  

This article is cited in 7 scientific papers (total in 7 papers)

Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions

K. L. Rychkov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Full text: PDF file (1457 kB)

Bibliographic databases:
UDC: 519.714
Received: 26.09.1994

Citation: K. L. Rychkov, “Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions”, Sibirsk. Zh. Issled. Oper., 1:4 (1994), 33–52

Citation in format AMSBIB
\Bibitem{Ryc94}
\by K.~L.~Rychkov
\paper Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions
\jour Sibirsk. Zh. Issled. Oper.
\yr 1994
\vol 1
\issue 4
\pages 33--52
\mathnet{http://mi.mathnet.ru/da499}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1340149}
\zmath{https://zbmath.org/?q=an:0848.94028}


Linking options:
  • http://mi.mathnet.ru/eng/da499
  • http://mi.mathnet.ru/eng/da/v1/i4/p33

    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

    This publication is cited in the following articles:
    1. K. L. Rychkov, “O slozhnosti obobschennykh kontaktnykh skhem”, Diskretn. analiz i issled. oper., 16:5 (2009), 78–87  mathnet  mathscinet  zmath
    2. K. L. Rychkov, “Nizhnyaya otsenka slozhnosti realizatsii v klasse $\pi$-skhem $q$-ichnogo schetchika kratnosti $q$”, Diskretn. analiz i issled. oper., 17:6 (2010), 68–76  mathnet  mathscinet  zmath
    3. S. V. Avgustinovich, Yu. L. Vasil'ev, K. L. Rychkov, “The computation complexity in the class of formulas”, J. Appl. Industr. Math., 6:4 (2012), 403–409  mathnet  crossref  mathscinet
    4. Yu. L. Vasil'ev, K. L. Rychkov, “A lower bound on formula size of a ternary linear function”, J. Appl. Industr. Math., 7:4 (2013), 588–596  mathnet  crossref  mathscinet
    5. K. L. Rychkov, “O nizhnikh otsenkakh formulnoi slozhnosti lineinoi bulevoi funktsii”, Sib. elektron. matem. izv., 11 (2014), 165–184  mathnet
    6. K. L. Rychkov, “Sufficient conditions for the minimal $\pi$-schemes for linear Boolean functions to be locally non-repeating”, J. Appl. Industr. Math., 9:4 (2015), 580–587  mathnet  crossref  crossref  mathscinet  elib
    7. K. L. Rychkov, “Complexity of the realization of a linear Boolean function in the class of $\pi$-schemes”, J. Appl. Industr. Math., 12:3 (2018), 540–576  mathnet  crossref  crossref  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:165
    Full text:71
    First page:1

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