1 problem

0 votes0 replies1 view
Llewellyn–Tovey–Trick conjecture on the optimal strict saddlepoint algorithm
Llewellyn–Tovey–Trick conjecture. The runtime $O\left(n^{\lg 3}\right)$ is essentially optimal for finding a strict saddlepoint.
Conjectureopenalgorithms game-theory matrix-algorithmsarXiv posted 2 days ago

Llewellyn–Tovey–Trick conjecture on the optimal strict saddlepoint algorithm