Bounds on monotone switching networks for directed connectivity
Abstract
We separate monotone analogues of L and NL by proving that any monotone switching network solving directed connectivity on n vertices must have size at least n(((n))).
0
We separate monotone analogues of L and NL by proving that any monotone switching network solving directed connectivity on n vertices must have size at least n(((n))).