On the asymptotic behavior of Shannon-type functions characterizing the computing complexity of systems of monomials
In this paper, we examined the computational complexity of systems of monomials for some models that allow multiple use of intermediate results, such as composition circuits and multiplication circuits. For these models, we studied Shannon-type functions that characterize the maximum computationa...
Main Author: | S.A. Korneev |
---|---|
Format: | Article |
Language: | English |
Published: |
Kazan Federal University
2020-09-01
|
Series: | Учёные записки Казанского университета. Серия Физико-математические науки |
Subjects: | |
Online Access: | https://kpfu.ru/uz-eng-phm-2020-3-5.html |
Similar Items
-
The Monomial Difference Majorized by Single Variable Function
by: Budzik Dorota
Published: (2015-03-01) -
Stability of a Monomial Functional Equation on a Restricted Domain
by: Yang-Hi Lee
Published: (2017-10-01) -
Kode Siklis dari Sebuah Monomial
by: Nopendri Nopendri, et al.
Published: (2019-07-01) -
On the monomial birational maps of the projective space
by: Gonzalez-Sprinberg Gérard, et al.
Published: (2003-01-01) -
An algorithm to compute the Stanley depth of monomial ideals
by: Giancarlo Rinaldo
Published: (2008-11-01)