Geometric optimization and unique sink orientations of cubes
From MaRDI portal
Recommendations
- Counting unique-sink orientations
- Finding the sink takes some time. An almost quadratic lower bound for finding the sink of unique sink oriented cubes.
- Finding the sink takes some time: An almost quadratic lower bound for finding the sink of unique sink oriented cubes
- Unique Sink Orientations of Grids
- Unique sink orientations of grids
Cited in
(11)- Finding the sink takes some time: An almost quadratic lower bound for finding the sink of unique sink oriented cubes
- The complexity of optimization on grids
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations
- Counting unique-sink orientations
- The number of unique-sink orientations of the hypercube
- The complexity of recognizing unique sink orientations
- Unique Sink Orientations of Grids
- Finding the sink takes some time. An almost quadratic lower bound for finding the sink of unique sink oriented cubes.
- The niceness of unique sink orientations
- On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes
- Unique sink orientations of grids
This page was built for publication: Geometric optimization and unique sink orientations of cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311162)