Lower Bounds for Tropical Circuits and Dynamic Programs
Computational Complexity
2018-05-30 v2
Abstract
Tropical circuits are circuits with Min and Plus, or Max and Plus operations as gates. Their importance stems from their intimate relation to dynamic programming algorithms. The power of tropical circuits lies somewhere between that of monotone boolean circuits and monotone arithmetic circuits. In this paper we present some lower bounds arguments for tropical circuits, and hence, for dynamic programs.
Keywords
Cite
@article{arxiv.1406.3065,
title = {Lower Bounds for Tropical Circuits and Dynamic Programs},
author = {Stasys Jukna},
journal= {arXiv preprint arXiv:1406.3065},
year = {2018}
}
Comments
Corrected reduction to arithmetic circuits (holds only for multilinear polynomials, now Sect. 4). Solved Open Problem 3 about Min/Max gaps (now Lemma 10). Added lower bounds for the depth of tropical circuits (Sect. 15)