Space-Efficient Counting in Graphs on Surfaces

@article{Braverman2009SpaceEfficientCI,
  title={Space-Efficient Counting in Graphs on Surfaces},
  author={M. Braverman and R. Kulkarni and Sambuddha Roy},
  journal={computational complexity},
  year={2009},
  volume={18},
  pages={601-649}
}
Abstract.We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the modular setting. We exhibit the problem to be complete for Logspace when the modulus is 2k, for constant k. On the other hand, we show that for any other modulus and in the non-modular case, our problem is as hard in the planar case as for the case of arbitrary graphs. The techniques used are algebraic… Expand
Tree-width and Logspace: Determinants and Counting Euler Tours
Checking Equality of Matroid Linear Representations and the Cycle Matching Problem
  • T. Vijayaraghavan
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2009
Space Complexity of Optimization Problems in Planar Graphs
Formal Theories for Linear Algebra
Formal Theories for Linear Algebra

References

SHOWING 1-10 OF 28 REFERENCES
Parity Problems in Planar Graphs
Determinants, Paths, and Plane Partitions
Undirected ST-connectivity in log-space
Structure and Importance of Logspace-MOD-Classes
Problems Complete for Deterministic Logarithmic Space
Uniform constant-depth threshold circuits for division and iterated multiplication
On the Parity of Graph Spanning Tree Numbers
The Complexity of Computing the Permanent
  • L. Valiant
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1979
Algebraic Graph Theory
PP is as Hard as the Polynomial-Time Hierarchy
...
1
2
3
...