%0 Journal Article
%T Factoring bivariate lacunary polynomials without heights
%A Arkadev Chattopadhyay
%A Bruno Grenet
%A Pascal Koiran
%A Natacha Portier
%A Yann Strozecki
%J Computer Science
%D 2012
%I arXiv
%R 10.1145/2465506.2465932
%X We present an algorithm which computes the multilinear factors of bivariate lacunary polynomials. It is based on a new Gap Theorem which allows to test whether a polynomial of the form P(X,X+1) is identically zero in time polynomial in the number of terms of P(X,Y). The algorithm we obtain is more elementary than the one by Kaltofen and Koiran (ISSAC'05) since it relies on the valuation of polynomials of the previous form instead of the height of the coefficients. As a result, it can be used to find some linear factors of bivariate lacunary polynomials over a field of large finite characteristic in probabilistic polynomial time.
%U http://arxiv.org/abs/1206.4224v3