Journal of Algorithms
Problems complete for deterministic logarithmic space
Journal of Algorithms
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
NC algorithms for computing the number of perfect matchings in K3,3-free graph and related problems
Information and Computation
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
An $\cal NC$ Algorithm for Evaluating Monotone Planar Circuits
SIAM Journal on Computing
The Complexity of Planar Counting Problems
SIAM Journal on Computing
The complexity of matrix rank and feasible systems of linear equations
Computational Complexity
Isolation, matching and counting uniform and nonuniform upper bounds
Journal of Computer and System Sciences
Making Nondeterminism Unambiguous
SIAM Journal on Computing
A note on closure properties of logspace MOD classes
Information Processing Letters
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
The complexity of planarity testing
Information and Computation
The combinatorial approach yields an NC algorithm for computing Pfaffians
Discrete Applied Mathematics
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Grid Graph Reachability Problems
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Directed Planar Reachability is in Unambiguous Log-Space
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
An NC algorithm for the general planar monotone circuit value problem
SPDP '91 Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed Processing
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
#3-Regular bipartite planar vertex cover is #p-complete
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
| Hi-index | 0.00 |
We explore the restrictiveness of planarity on the complexity of computing the determinant and the permanent, and show that both problems remain as hard as in the general case, i.e. GapL and #P complete. On the other hand, both bipartite planarity and bimodal planarity bring the complexity of permanents down (but no further) to that of determinants. The permanent or the determinant modulo 2 is complete for ⊕L, and we show that parity of paths in a layered grid graph (which is bimodal planar) is also complete for this class. We also relate the complexity of grid graph reachability to that of testing existence/uniqueness of a perfect matching in a planar bipartite graph.