Pages that link to "Item:Q4180165"
From MaRDI portal
The following pages link to Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem (Q4180165):
Displayed 19 items.
- A Mihalisin-Klee theorem for fans (Q306503) (← links)
- Enumeration of PLCP-orientations of the 4-cube (Q491752) (← links)
- An exponential lower bound for Cunningham's rule (Q507321) (← links)
- Combinatorial characterizations of \(K\)-matrices (Q609481) (← links)
- On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (Q713305) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- Observations on a class of nasty linear complementarity problems (Q1141086) (← links)
- Solving more linear complementarity problems with Murty's Bard-type algorithm (Q1321349) (← links)
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694) (← links)
- On the Holt-Klee property for oriented matroid programming (Q2065995) (← 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)
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games (Q3507443) (← links)
- Computational complexity of LCPs associated with positive definite symmetric matrices (Q3854941) (← links)
- A variable dimension algorithm for the linear complementarity problem (Q3885547) (← links)
- (Q5111758) (← links)
- Realizability makes a difference: a complexity gap for sink-finding in USOs (Q6139054) (← links)