2 papers
math.AG2022
The Duality of SONC: Advances in Circuit-based Certificates
Janin Heuer, Timo de Wolff
The cone of sums of nonnegative circuits (SONCs) is a subset of the cone of nonnegative polynomials / exponential sums, which has been studied extensively in recent years. In this…
math.CO2014
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…