A taxonomy of problems with fast parallel algorithms
Information and Control
Relativized circuit complexity
Journal of Computer and System Sciences
Problems complete for deterministic logarithmic space
Journal of Algorithms
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Proceedings of the 30th IEEE symposium on Foundations of computer science
Counting quantifiers, successor relations, and logarithmic space
Journal of Computer and System Sciences - special issue on complexity theory
Journal of the ACM (JACM)
Journal of the ACM (JACM)
An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs
Journal of the ACM (JACM)
Making Nondeterminism Unambiguous
SIAM Journal on Computing
A compendium of problems complete for symmetric logarithmic space
Computational Complexity
Graph Algorithms
The Complexity of Graph Connectivity
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Randomization and Derandomization in Space-Bounded Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Symmetric Logspace is Closed Under Complement
Symmetric Logspace is Closed Under Complement
A Combinatorial Algorithm for Pfaffians
A Combinatorial Algorithm for Pfaffians
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case
ACM Transactions on Computation Theory (TOCT)
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
One-input-face MPCVP is hard for l, but in LogDCFL
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Evaluating monotone circuits on cylinders, planes and tori
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L = SL. The Upper bound of SL matches the lower bound of L in the context of (non-uniform) circuit complexity, since L/poly is equal to SL/poly. Similarly, we show that a planar embedding, when one exists, can be found in FLSL. Previously, these problems were known to reside in the complexity class AC1, via the O(log n) time CRCW-PRAM algorithm of Ramachandran and Reif, although planarity checking for degree-three graphs had been shown to be in SL [Chicago J. Theoret. Comput. Sci. (1995); J. ACM 31(2) (1984) 401].