4 citations to https://www.mathnet.ru/eng/vmumm883
  1. S. A. Korneev, “On the complexity of implementation of a system of two monomials by composition circuits”, Discrete Math. Appl., 31:2 (2021), 113–125  mathnet  crossref  crossref  mathscinet  isi  elib
  2. V. V. Kochergin, “A simple proof for the upper bound of the computational complexity of three monomials in three variables”, Moscow University Mathematics Bulletin, 74:2 (2019), 43–48  mathnet  crossref  mathscinet  zmath  isi
  3. V. V. Kochergin, “On Bellman's and Knuth's problems and their generalizations”, J. Math. Sci., 233:1 (2018), 103–124  mathnet  crossref
  4. E. N. Trusevich, “Complexity of certain systems of monomials in calculation by composition circuits”, Moscow University Mathematics Bulletin, 69:5 (2014), 193–197  mathnet  crossref  mathscinet