13 citations · 13 across the 3 of their papers we have counts for
1 paper · 2 filters
Bernd Gärtner, Markus Sprecher
We give a polynomial-time dynamic programming algorithm for solving the linear complementarity problem with tridiagonal or, more generally, Hessenberg P-matrices. We briefly review…