27 citations · 53 across the 10 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015
Log-concavity and lower bounds for arithmetic circuits
Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas
One question that we investigate in this paper is, how can we build log-concave polynomials using sparse polynomials as building blocks? More precisely, let $f = \sum\_{i = 0}^d a\…
cs.CG2015★ 27 cited
Building Efficient and Compact Data Structures for Simplicial Complexes
Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas
The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range…