1 citations · 2 across the 9 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.OC2020
A Note on the Approximability of Deepest-Descent Circuit Steps
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann +1
Linear programs (LPs) can be solved by polynomially many moves along the circuit direction improving the objective the most, so-called deepest-descent steps (dd-steps). Computing t…
cs.DS2020★ 1 cited
An Algorithmic Method of Partial Derivatives
Cornelius Brand, Kevin Pratt
We study the following problem and its applications: given a homogeneous degree- polynomial as an arithmetic circuit, and a matrix whose entries are homogen…