Fundamentalnaya i Prikladnaya Matematika
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

Fundamentalnaya i Prikladnaya Matematika, 2009, Volume 15, Issue 3, Pages 135–181 (Mi fpm1232)  
This article is cited in 4 scientific papers (total in 4 papers)

On algorithm complexity

V. B. Kudryavtsev, A. E. Andreev

M. V. Lomonosov Moscow State University
Full-text PDF (392 kB) Citations (4)
References:
PDF
HTML
Abstract: This paper contains review of the authors' results in the theory of algorithm complexity. The results described concern the methods for obtaining lower bounds (containing almost all exponential lower bounds on monotone complexity of monotone functions), asymptotically optimal functional networks' synthesis, Boolean functions minimization, and the problems of solving Boolean equations.
English version:
Journal of Mathematical Sciences (New York), 2010, Volume 168, Issue 1, Pages 89–122
DOI: https://doi.org/10.1007/s10958-010-9977-y
Bibliographic databases:
UDC: 519.95
Language: Russian
Citation: V. B. Kudryavtsev, A. E. Andreev, “On algorithm complexity”, Fundam. Prikl. Mat., 15:3 (2009), 135–181; J. Math. Sci., 168:1 (2010), 89–122
Citation in format AMSBIB
\Bibitem{KudAnd09}
\by V.~B.~Kudryavtsev, A.~E.~Andreev
\paper On algorithm complexity
\jour Fundam. Prikl. Mat.
\yr 2009
\vol 15
\issue 3
\pages 135--181
\mathnet{http://mi.mathnet.ru/fpm1232}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2744976}
\elib{https://elibrary.ru/item.asp?id=15318011}
\transl
\jour J. Math. Sci.
\yr 2010
\vol 168
\issue 1
\pages 89--122
\crossref{https://doi.org/10.1007/s10958-010-9977-y}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77954029192}
Linking options:
  • https://www.mathnet.ru/eng/fpm1232
  • https://www.mathnet.ru/eng/fpm/v15/i3/p135
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Фундаментальная и прикладная математика
    Statistics & downloads:
    Abstract page:659
    Full-text PDF :310
    References:78
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024