Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...