1. V. M. Khrapchenko, “Method of determining lower bounds for the complexity of $$P$$-schemes,” Math. Notes 10 (1), 474–479 (1971).
2. B. A. Subbotovskaya, “Realization of linear functions by formulas using $$\vee$$, $$\&$$, $$^-$$,” Dokl. Akad. Nauk SSSR 136 (3), 553–555 (1961).
3. B. A. Muchnik, “Estimation of the complexity of the realization of a linear function by formulae in certain bases,” Kibernetika (Kiev) 4, 29–38 (1970).
4. N. A. Peryazev, “Complexity of representations of Boolean functions by formulas in nonmonolinear bases,” in Diskret. Mat. Inform. (Izd. Irkutsk Univ., Irkutsk, 1995), Vol. 2.
5. D. Yu. Cherukhin, “On the complexity of the realization of a linear function by formulas in finite Boolean bases,” Discrete Math. Appl. 10 (2), 147–157 (2000).