Improved upper and lower bound techniques for monotone switching networks for directed connectivity
Abstract
In this paper, we analyze the monotone space of complexity of directed connectivity for a large class of input graphs G using the switching network model. The upper and lower bounds we obtain are a significant generalization of previous results and the proofs involve several completely new techniques and ideas.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.