Pages that link to "Item:Q1611006"

The following pages link to Randomized pivot algorithms for \(P\)-matrix linear complementarity problems (Q1611006):

Displaying 13 items.

• Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
• Enumeration of PLCP-orientations of the 4-cube (Q491752) (← links)
• Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix (Q715065) (← links)
• Violator spaces: Structure and algorithms (Q943850) (← links)
• Cyclic games and linear programming (Q944703) (← links)
• A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694) (← links)
• Unique end of potential line (Q2194856) (← links)
• A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← links)
• Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
• Counting unique-sink orientations (Q2434730) (← links)
• Random edge can be exponential on abstract cubes (Q2496719) (← links)
• Unique End of Potential Line (Q5091211) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)