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, 1985, Volume 37, Issue 6, Pages 887–900 (Mi mz5393)  

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

Lower bounds on monotone complexity of the logical permanent

A. A. Razborov


Full text: PDF file (1092 kB)

English version:
Mathematical Notes, 1985, 37:6, 485–493

Bibliographic databases:

UDC: 519.95
Received: 10.01.1985

Citation: A. A. Razborov, “Lower bounds on monotone complexity of the logical permanent”, Mat. Zametki, 37:6 (1985), 887–900; Math. Notes, 37:6 (1985), 485–493

Citation in format AMSBIB
\Bibitem{Raz85}
\by A.~A.~Razborov
\paper Lower bounds on monotone complexity of the logical permanent
\jour Mat. Zametki
\yr 1985
\vol 37
\issue 6
\pages 887--900
\mathnet{http://mi.mathnet.ru/mz5393}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=802432}
\zmath{https://zbmath.org/?q=an:0584.94026}
\transl
\jour Math. Notes
\yr 1985
\vol 37
\issue 6
\pages 485--493
\crossref{https://doi.org/10.1007/BF01157687}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=A1985AYE1900031}


Linking options:
  • http://mi.mathnet.ru/eng/mz5393
  • http://mi.mathnet.ru/eng/mz/v37/i6/p887

    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. A. A. Razborov, “Lower estimates of the dimension of schemes of bounded depth in the basis $\{&,\vee,\oplus\}$”, Russian Math. Surveys, 41:4 (1986), 181–182  mathnet  crossref  mathscinet  zmath  adsnasa  isi
    2. Izv. Math., 59:1 (1995), 205–227  mathnet  crossref  mathscinet  zmath  isi
    3. A. D. Korshunov, “Monotone Boolean functions”, Russian Math. Surveys, 58:5 (2003), 929–1001  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib
    4. A. D. Korshunov, “Some unsolved problems in discrete mathematics and mathematical cybernetics”, Russian Math. Surveys, 64:5 (2009), 787–803  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    5. V. B. Kudryavtsev, A. E. Andreev, “On algorithm complexity”, J. Math. Sci., 168:1 (2010), 89–122  mathnet  crossref  mathscinet  elib
    6. 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
    7. 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
    8. S. B. Gashkov, I. S. Sergeev, “A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials”, Sb. Math., 203:10 (2012), 1411–1447  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
  • Математические заметки Mathematical Notes
    Number of views:
    This page:538
    Full text:198
    First page:4

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