On the recognition problem for algebraic threshold functions

We prove the existence of recognition algorithm for algebraic Boolean threshold functions by calculating upper bounds of absolute values of modulo and coefficients of a linear form. The modulo bound looks like $(n+3)^{(n+5)/2}/2^{n+2}$ and the bound of algorithm complexity is O$(({{n}/{2}})^{n^2})$.