单调切换网络有向连通性的界
Bounds on monotone switching networks for directed connectivity
摘要：
我们通过证明任何求解$n$顶点上的有向连通性的单调切换网络必须具有至少$n^(Ω(\lg(n)))$的大小来分离L和NL的单调类似物。
英文摘要：
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^(Ω(\lg(n)))$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
