1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.GT2006★ 1 cited
Matrix Games, Linear Programming, and Linear Approximation
L. N. Vaserstein
The following four classes of computational problems are equivalent: solving matrix games, solving linear programs, best linear approximation, best linear approx…
math.OC2006★ 1 cited
Reduction of Linear Programming to Linear Approximation
Leonid N. Vaserstein
It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to…
math.GR2005
A note on Bruhat decomposition of GL(n) over local principal ideal rings
Uri Onn, Amritanshu Prasad, Leonid Vaserstein
Let A be a local commutative principal ideal ring. We study the double coset space of GL(n,A) with respect to the subgroup of upper triangular matrices. Geometrically, these cosets…