Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari. Shortest path length with bounded-alternation (min, +) formulas. Electronic Colloquium on Computational Complexity (ECCC), 25:146, 2018. [doi]
@article{MahajanNT18a,
title = {Shortest path length with bounded-alternation (min, +) formulas},
author = {Meena Mahajan and Prajakta Nimbhorkar and Anuj Tawari},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/146},
researchr = {https://researchr.org/publication/MahajanNT18a},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {25},
pages = {146},
}