Bounds on monotone switching networks for directed connectivity
Computational Complexity
2016-12-01 v7
Abstract
We separate monotone analogues of L and NL by proving that any monotone switching network solving directed connectivity on vertices must have size at least .
Cite
@article{arxiv.0911.0664,
title = {Bounds on monotone switching networks for directed connectivity},
author = {Aaron Potechin},
journal= {arXiv preprint arXiv:0911.0664},
year = {2016}
}
Comments
49 pages, 12 figures