COMPARATIVE ESTIMATION OF COMPUTATIONAL BOOLEAN FUNCTION POLYNOMIAL TRANSFORM ALGORITHMS
The present paper covers features of the polynonial factoring of n-argument boolean functions and analyzes their computational complexity and required PC hardware resources