Polynomial-Time P-Matrix Linear Complementarity Problem
Determine whether the unique solution of every linear complementarity problem with a rational P-matrix and rational right-hand side can be computed in time polynomial in the bit length of the input.
Source: A new combinatorial property of geometric unique sink orientations.
Status Open · subcases solved Status review date not recorded in this edition
Listed by ProofAtlas. Status qualification is attributed to ProofAtlas; no full resolution is certified here.
References
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.