|
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
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.
Received: 20.06.2012
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
Linking options:
https://www.mathnet.ru/eng/vmumm409 https://www.mathnet.ru/eng/vmumm/y2013/i3/p55
|
Statistics & downloads: |
Abstract page: | 121 | Full-text PDF : | 50 | References: | 21 |
|