We estimate the number of possible degree patterns of k-lacunary polynomials of degree t<p which split completely modulo p. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph theory arguments.6 page(s
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
We present a deterministic polynomial-time algorithm which computes the multilinear factors of multi...
AbstractThe main theme is the distribution of polynomials of given degree which split into a product...
International audienceIn this paper, we present a new method for computing bounded-degree factors of...
Abstract. In this paper, we present a new method for computing bounded-degree factors of lacunary mu...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
37 pages.We present a deterministic polynomial-time algorithm which computes the multilinear factors...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
International audienceWe present a deterministic algorithm which computes the multilinear factors of...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
International audienceWe present a deterministic algorithm which computes the multilinear factors of...
International audienceWe present a deterministic algorithm which computes the multilinear factors of...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
We present a deterministic polynomial-time algorithm which computes the multilinear factors of multi...
AbstractThe main theme is the distribution of polynomials of given degree which split into a product...
International audienceIn this paper, we present a new method for computing bounded-degree factors of...
Abstract. In this paper, we present a new method for computing bounded-degree factors of lacunary mu...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
37 pages.We present a deterministic polynomial-time algorithm which computes the multilinear factors...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
International audienceWe present a deterministic algorithm which computes the multilinear factors of...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
International audienceWe present a deterministic algorithm which computes the multilinear factors of...
International audienceWe present a deterministic algorithm which computes the multilinear factors of...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
22 pagesInternational audienceWe present a new algorithm for the computation of the irreducible fact...
We present a deterministic polynomial-time algorithm which computes the multilinear factors of multi...
AbstractThe main theme is the distribution of polynomials of given degree which split into a product...