Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2013, Number 3, Pages 55–57 (Mi vmumm409)  
This article is cited in 1 scientific paper (total in 1 paper)

Short notes

Orders of growth of Shannon functions for circuit complexity over infinite bases

O. M. Kasim-zade

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (214 kB) Citations (1)
References:
PDF
HTML
Abstract: It is shown that any function of one real variable being composition of rational functions with real coefficients, logarithms, and exponents and having an order of growth between $n$ and $2^{O(n^{1/2})}$ is an order of growth of the Shannon function for the circuit complexity over a certain infinite basis.
Key words: Boolean function, circuit of functional elements, complexity, Shannon function.
Funding agency Grant number
Russian Foundation for Basic Research 11-01-00508
Russian Academy of Sciences - Federal Agency for Scientific Organizations
Received: 20.06.2012
English version:
Moscow University Mathematics Bulletin, 2013, Volume 68, Issue 3, Pages 170–172
DOI: https://doi.org/10.3103/S0027132213030078
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: O. M. Kasim-zade, “Orders of growth of Shannon functions for circuit complexity over infinite bases”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2013, no. 3, 55–57; Moscow University Mathematics Bulletin, 68:3 (2013), 170–172
Citation in format AMSBIB
\Bibitem{Kas13}
\by O.~M.~Kasim-zade
\paper Orders of growth of Shannon functions for circuit complexity over infinite bases
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2013
\issue 3
\pages 55--57
\mathnet{http://mi.mathnet.ru/vmumm409}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3185286}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2013
\vol 68
\issue 3
\pages 170--172
\crossref{https://doi.org/10.3103/S0027132213030078}
Linking options:
  • https://www.mathnet.ru/eng/vmumm409
  • https://www.mathnet.ru/eng/vmumm/y2013/i3/p55
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:134
    Full-text PDF :55
    References:25
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024