Bounds on monotone switching networks for directed connectivity

Details Bounds on monotone switching networks for directed connectivity Bounds on monotone switching networks for directed connectivity

2009-11-03

arxiv.org/abs/0911.0664v4

Computer Science

Computational Complexity

29 pages, 8 figures

Scientific paper

We prove that any monotone switching network solving directed connectivity on
N vertices must have size at least N^(Omega(logN)).

Affiliated with

Also associated with

No associations

Rating

Bounds on monotone switching networks for directed connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds on monotone switching networks for directed connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on monotone switching networks for directed connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-618697