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...

Full description

Bibliographic Details
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