The complexity of planarity testing
Information and Computation
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We present a Logspace, many-one reduction from the undirected s-t connectivity problem to its complement. This shows that SL=coSL.