Improved upper and lower bound techniques for monotone switching networks for directed connectivity
Potechin, Aaron
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.