Completely unimodal numberings of a simple polytope
Discrete Applied Mathematics
A simple way to tell a simple polytope from its graph
Journal of Combinatorial Theory Series A
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Shadows and slices of polytopes
Proceedings of the twelfth annual symposium on Computational geometry
Finding the Sink Takes Some Time
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Unique Sink Orientations of Cubes
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Linear programming and unique sink orientations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Violator spaces: structure and algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Violator spaces: Structure and algorithms
Discrete Applied Mathematics
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
| Hi-index | 0.00 |
We construct a class of abstract objective functions on the cube, such that the algorithm BottomAntipodal takes exponentially many steps to find the maximum. A similar class of abstract objective functions is constructed for the process BottomTop, also requiring exponentially many steps.