On the complexity of implementation of a system of two monomials by composition circuits
-
Sergey A. Korneev
Abstract
The complexity of implementation of systems of monomials by composition circuits is studied. In such a model, the complexity is understood as the smallest number of composition operations required for computation of a system of monomials. The main result is an exact formula which, for an arbitrary pair of monomials, gives the complexity of their joint implementation by composition circuits.
Originally published in Diskretnaya Matematika (2020) 32, №2, 15–31 (in Russian).
Funding statement: This research was carried out with the financial support of the Russian Foundation for Basic Research (grant no. 18-01-00337-a)
References
[1] Shirshov A. I., “Some algorithmic problems for Lie algebras”, SelectedWorks of A.I. Shirshov, Contemporary Mathematicians, Birkhäuser Basel, 125–130, 242 pp.10.1007/978-3-7643-8858-4_13Search in Google Scholar
[2] Merekin Yu. V., “On the generation of words using the composition operation”, Diskretn. Anal. i Issled. Oper., Ser. 1, 10:4 (2003), 70–78 (in Russian)Search in Google Scholar
[3] Trusevich E. N., “Complexity of certain systems of monomials in calculation by composition circuits”, Moscow Univ. Math. Bull., 69:5 (2014), 193–19710.3103/S0027132214050039Search in Google Scholar
[4] Lupanov O. B., Asymptotic Estimates for the Complexity of Control Systems, izd-vo Mosk. un-ta, Moscow, 1984 (in Russian), 138 pp.Search in Google Scholar
[5] Kochergin V. V., “On the complexity of computation of three monomials in three variables”,Matematicheskie Voprosy Kiber-netiki, 2006,№15, 79–154 (in Russian).10.1515/156939205774939353Search in Google Scholar
[6] Kochergin V. V., “Relation between two measures of the computation complexity for systems of monomials”, Moscow Univ. Math. Bull., 64 (2009), 144–149.10.3103/S0027132209040020Search in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Two-sided problem for the random walk with bounded maximal increment
- On the use of binary operations for the construction of a multiply transitive class of block transformations
- On the complexity of implementation of a system of two monomials by composition circuits
- On the degree of restrictions of q-valued logic vector functions to linear manifolds
- Trees with a given number of leaves and the maximal number of maximum independent sets
- Size distribution of the largest component of a random A-mapping
Articles in the same Issue
- Frontmatter
- Two-sided problem for the random walk with bounded maximal increment
- On the use of binary operations for the construction of a multiply transitive class of block transformations
- On the complexity of implementation of a system of two monomials by composition circuits
- On the degree of restrictions of q-valued logic vector functions to linear manifolds
- Trees with a given number of leaves and the maximal number of maximum independent sets
- Size distribution of the largest component of a random A-mapping
