An exponential upper bound is proven on the handicap number of sufficient matrices, together with a polynomial-time algorithm in the optimized rescaled handicap for solving the corresponding LCPs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Handicap reduction for linear complementarity problems
An exponential upper bound is proven on the handicap number of sufficient matrices, together with a polynomial-time algorithm in the optimized rescaled handicap for solving the corresponding LCPs.