RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Mat. Zametki, 1990, Volume 48, Issue 6, Pages 79–90 (Mi mz3411)  

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

Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits

A. A. Razborov

V. A. Steklov Mathematical Institute, USSR Academy of Sciences

Full text: PDF file (1382 kB)

English version:
Mathematical Notes, 1990, 48:6, 1226–1234

Bibliographic databases:

Received: 07.12.1989

Citation: A. A. Razborov, “Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits”, Mat. Zametki, 48:6 (1990), 79–90; Math. Notes, 48:6 (1990), 1226–1234

Citation in format AMSBIB
\Bibitem{Raz90}
\by A.~A.~Razborov
\paper Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits
\jour Mat. Zametki
\yr 1990
\vol 48
\issue 6
\pages 79--90
\mathnet{http://mi.mathnet.ru/mz3411}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1102624}
\zmath{https://zbmath.org/?q=an:0801.68091|0712.68053}
\transl
\jour Math. Notes
\yr 1990
\vol 48
\issue 6
\pages 1226--1234
\crossref{https://doi.org/10.1007/BF01240265}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=A1990FY46100025}


Linking options:
  • http://mi.mathnet.ru/eng/mz3411
  • http://mi.mathnet.ru/eng/mz/v48/i6/p79

    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 svyazi nizhnikh otsenok slozhnosti skhem iz funktsionalnykh elementov s zadachei o minimalnom pokrytii”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 9:1 (2002), 54–58  mathnet  mathscinet  zmath
    2. E. A. Okolnishnikova, “Lower bound for the computation complexity of BCH-codes for branching programs”, J. Appl. Industr. Math., 4:2 (2010), 231–235  mathnet  crossref  mathscinet  zmath
    3. A. D. Korshunov, “Computational complexity of Boolean functions”, Russian Math. Surveys, 67:1 (2012), 93–165  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    4. A. P. Davydow, S. I. Nikolenko, “Circuit complexity of linear functions: gate elimination and feeble security”, J. Math. Sci. (N. Y.), 188:1 (2013), 35–46  mathnet  crossref  mathscinet
  • Математические заметки Mathematical Notes
    Number of views:
    This page:404
    Full text:140
    First page:4

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