http://dcherukhin.i2p/research/research.htm
A function
$$(f\otimes g)(x_1,\dots,x_nm)=
f\bigl(g(x_1,\dots,x_m),\dots,g(x_{(n-1)m+1},\dots,x_nm)\bigr)$$ is called a
repetition-free product of Boolean functions. A criterion is given that makes it
possible to check whether a sequence of products of Boolean functions can be
computed with linear size formulas in a basis $B$. О сложности произведений
булевых функций в классе
формул // Материалы 5-й
молодёжной научной школы по
дискретной...