115 citations · 430 across the 53 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016
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…
math.CO2016★ 1 cited
A Proof of the Barát-Thomassen Conjecture
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le +2
The Barát-Thomassen conjecture asserts that for every tree on edges, there exists a constant such that every -edge-connected graph with size divisible by can…