2000 character limit reached
Bounds on monotone switching networks for directed connectivity
Published 3 Nov 2009 in cs.CC | (0911.0664v7)
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\mega(\lg(n)))$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.