2 citations · 6 across the 8 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.SC2018
Computing Elimination Ideals and Discriminants of Likelihood Equations
Xiaoxian Tang, Timo De Wolff, Rukai Zhao
We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bas…
cs.DS2018★ 1 cited
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials
Mareike Dressler, Adam Kurpisz, Timo de Wolff
Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove com…
math.DS2018
Nondegenerate multistationarity in small reaction networks
Anne Shiu, Timo de Wolff
Much attention has been focused in recent years on the following algebraic problem arising from applications: which chemical reaction networks, when taken with mass-action kinetics…