Pages that link to "Item:Q5384026"
From MaRDI portal
The following pages link to Improved upper bounds for Random-Edge and Random-Jump on abstract cubes (Q5384026):
Displaying 11 items.
- Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
- Unique end of potential line (Q2194856) (← 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)
- Geometric random edge (Q2364496) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- (Q4553289) (← links)
- Random-Edge Is Slower Than Random-Facet on Abstract Cubes (Q4598190) (← links)
- The Niceness of Unique Sink Orientations (Q4636463) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- (Q5111758) (← links)