115 citations · 430 across the 53 of their papers we have counts for
3 papers · 1 filter
On the complexity of partial derivatives
Ignacio Garcia-Marco, Pascal Koiran, Timothée Pecatte +1
The method of partial derivatives is one of the most successful lower bound methods for arithmetic circuits. It uses as a complexity measure the dimension of the span of the partia…
A tau-conjecture for Newton polygons
Pascal Koiran, Natacha Portier, Sébastien Tavenas +1
One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coef…
Symmetric Determinantal Representations in Characteristic 2
Bruno Grenet, Thierry Monteil, Stéphan Thomassé
This paper studies Symmetric Determinantal Representations (SDR) in characteristic 2, that is the representation of a multivariate polynomial P by a symmetric matrix M such that P=…