Sibirskii Zhurnal Issledovaniya 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

Sibirskii Zhurnal Issledovaniya Operatsii, 1994, Volume 1, Issue 4, Pages 33–52 (Mi da499)  
This article is cited in 8 scientific papers (total in 8 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 (1457 kB) Citations (8)
Received: 26.09.1994
Bibliographic databases:
UDC: 519.714
Language: Russian
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{https://mathscinet.ams.org/mathscinet-getitem?mr=1340149}
\zmath{https://zbmath.org/?q=an:0848.94028}
Linking options:
  • https://www.mathnet.ru/eng/da499
  • https://www.mathnet.ru/eng/da/v1/i4/p33
    • This publication is cited in the following 8 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Diskretnyi Analiz i Issledovanie Operatsii
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025