2 citations to https://www.mathnet.ru/eng/vmumm3821
-
S. B. Gashkov, I. S. Sergeev, “On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2”, Discrete Math. Appl., 23:1 (2013), 1–37
-
S. B. Gashkov, I. S. Sergeev, “Complexity of computation in finite fields”, J. Math. Sci., 191:5 (2013), 661–685