8 citations · 24 across the 17 of their papers we have counts for
4 papers · 1 filter
A Sharp Upper Bound for the Complexity of Labeled Oriented Trees
Moritz Christmann, Timo de Wolff
A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial…
Norms of Roots of Trinomials
Thorsten Theobald, Timo de Wolff
The behavior of norms of roots of univariate trinomials for fixed support with respect to the choice of…
Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
Sadik Iliman, Timo de Wolff
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnega…
Amoebas, Nonnegative Polynomials and Sums of Squares Supported on Circuits
Sadik Iliman, Timo de Wolff
We completely characterize sections of the cones of nonnegative polynomials, convex polynomials and sums of squares with polynomials supported on circuits, a genuine class of spars…