1. Alon, N., Boppana, R.: The monotone circuit complexity of Boolean functions. Combinatorica 7(1), 1–22 (1987)
2. Grinchuk, M.I., Sergeev, I.S.: Thin circulant matrices and lower bounds on the complexity of some Boolean operations. Diskretn. Anal. Issled. Oper. 18, pp. 35–53, (2011). (See also CORR.abs/1701.08557 2017
3. Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. J. ACM 29(3), 874–897 (1982)
4. Jukna, S.: Personnal communication, June (2022)
5. Jukna, S.: Notes on Boolean Read-k Circuits. Electron. Colloquium Comput. Complex. TR22-094 (2022)