The following pages link to Unique sink orientations of grids (Q930596):
Displaying 16 items.
- A Mihalisin-Klee theorem for fans (Q306503) (← links)
- Enumeration of PLCP-orientations of the 4-cube (Q491752) (← links)
- Efficient computation of a canonical form for a matrix with the generalized P-property (Q747763) (← links)
- Directed random walks on polytopes with few facets (Q1690029) (← links)
- Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
- Finding the sink takes some time: An almost quadratic lower bound for finding the sink of unique sink oriented cubes (Q1889918) (← links)
- On the Holt-Klee property for oriented matroid programming (Q2065995) (← links)
- The complexity of optimization on grids (Q2319631) (← 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)
- Deterministic Algorithms for Unique Sink Orientations of Grids (Q2817878) (← links)
- The Complexity of Recognizing Unique Sink Orientations (Q2955007) (← links)
- (Q4553289) (← links)
- Random Walks on Polytopes of Constant Corank (Q5116520) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311162) (← links)
