Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR18-146 | 18th August 2018 13:54

Shortest path length with bounded-alternation $(\min, +)$ formulas

RSS-Feed




TR18-146
Authors: Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
Publication: 19th August 2018 20:20
Downloads: 82
Keywords: 


Abstract:

We study bounded depth $(\min, +)$ formulas computing the shortest path polynomial. For depth $2d$ with $d \geq 2$, we obtain lower bounds parametrized by certain fan-in restrictions on all $+$ gates except those at the bottom level. For depth $4$, in two regimes of the parameter, the bounds are tight.



ISSN 1433-8092 | Imprint