Samir Datta
Meena Mahajan
Skip Abstract Section
Abstract
Viewing the computation of the determinant and the permanent of integer matrices as combinatorial problems on associated graphs, we explore the restrictiveness of planarity on their complexities and show that both problems remain as hard as in the general case, that is, 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.
- Allender, E. 2004. Arithmetic circuits and counting complexity classes. In Complexity of Computations and Proofs, J. Krajicek, Ed. Quaderni di Matematica Vol. 13. 33--72.Google Scholar
- Allender, E., Beals, R., and Ogihara, M. 1999a. The complexity of matrix rank and feasible systems of linear equations. Comput. Complex 8, 2, 99--126. Google ScholarDigital Library
- Allender, E., Rheinhardt, K., and Zhou, S. 1999b. Isolation, matching and counting: Uniform and nonuniform upper bounds. J. Comput. Syst. Sci. 59, 164--181. Google ScholarDigital Library
- Allender, E., Datta, S., and Roy, S. 2005. The directed planar reachability problem. In Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Lecture Notes in Computer Science vol. 3821. Springer, 238--249. Google ScholarDigital Library
- Allender, E., Barrington, D. A. M., Chakraborty, T., Datta, S., and Roy, S. 2009. Planar and grid graph reachability problems. Theory Comput. Syst. 45, 4, 675--723. Google ScholarDigital Library
- Allender, E. and Mahajan, M. 2004. The complexity of planarity testing. Inf. Comput. 189, 1, 117--134. Google ScholarDigital Library
- Arora, S. and Barak, B. 2009. Computational Complexity: A Modern Approach. Cambridge University Press. Google ScholarDigital Library
- Barrington, D. 1989. Bounded-Width polynomial size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38, 150--164. Google ScholarDigital Library
- Barrington, D. A. M. 2002. Grid graph reachability problems. Dogstuhl Seminar on Complexity of Boolean Funcions, seminar number 02121.Google Scholar
- Bourke, C., Tewari, R., and Vinodchandran, N. V. 2007. Directed planar reachability is in unambiguous logspace. In Proceedings of the 22nd IEEE Conference on Computational Complexity (CCC). IEEE, 217--221. Google ScholarDigital Library
- Bourke, C., Tewari, R., and Vinodchandran, N. V. 2009. Directed planar reachability is in unambiguous log-space. ACM Trans. Comput. Theory 1, 1, 1--17. Google ScholarDigital Library
- Chakraborty, T. and Datta, S. 2006. One-Input-Face MPCVP is hard for L, but in LogDCFL. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FST TCS) Conference. Lecture Notes in Computer Science, vol. 4337. Springer, 57--68. Google ScholarDigital Library
- Chandra, A., Stockmeyer, L., and Vishkin, U. 1984. Constant depth reducibility. SIAM J. Comput. 13, 2, 423--439.Google ScholarCross Ref
- Cook, S. A. and McKenzie, P. 1987. Problems complete for L. J. Algor. 8, 385--394. Google ScholarDigital Library
- Damm, C. 1991. DET=L(#L). Tech. rep. Informatik--Preprint 8, Fachbereich Informatik der Humboldt--Universität zu Berlin.Google Scholar
- Datta, S., Kulkarni, R., Limaye, N., and Mahajan, M. 2007. Planarity, determinants, permanents, and (unique) matchings. In Proceedings of the International Computer Science Symposium in Russia (CSR). Lecture Notes in Computer Science, vol. 4649. Springer, 115--126. Google ScholarDigital Library
- Datta, S., Kulkarni, R., and Roy, S. 2008. Deterministically isolating a perfect matching in bipartite planar graphs. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS’08). S. Albers and P. Weil, Eds. Leibniz International Proceedings in Informatics (LIPIcs), vol. 1. 229--240.Google Scholar
- Delcher, A. L. and Kosaraju, S. R. 1995. An NC algorithm for evaluating monotone planar circuits. SIAM J. Comput. 24, 2, 369--375. Google ScholarDigital Library
- Dyer, M. E. and Frieze, A. M. 1986. Planar 3DM is NP-complete. J. Algor 7, 2, 174--184. Google ScholarDigital Library
- Hansen, K. 2006. Constant width planar computation characterizes ACC0. Theory Comput. Syst. 39, 1, 79--92.Google ScholarCross Ref
- Hertrampf, U., Reith, S., and Vollmer, H. 2000. A note on closure properties of logspace MOD classes. Inform. Process. Lett. 75, 3, 91--93. Google ScholarDigital Library
- Hesse, W., Allender, E., and Barrington, D. 2002. Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65, 695--716. Google ScholarDigital Library
- Hoang, T. M., Mahajan, M., and Thierauf, T. 2006. On the bipartite unique perfect matching problem. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 4051. Springer, 453--464. Google ScholarDigital Library
- Hunt, III, H. B., Marathe, M. V., Radhakrishnan, V., and Stearns, R. E. 1998. The complexity of planar counting problems. SIAM J. Comput. 27, 4, 1142--1167. Google ScholarDigital Library
- Immerman, N. 1987. Languages which capture complexity classes. SIAM J. Comput. 4, 760--778. Google ScholarDigital Library
- Kulkarni, R., Mahajan, M., and Varadarajan, K. R. 2008. Some perfect matchings and perfect half-integral matchings in NC. Chicago J. Theor. Comput. Sci. 4.Google ScholarCross Ref
- Limaye, N., Mahajan, M., and Sarma, J. M. N. 2009. Upper bounds for monotone planar circuit value and variants. Comput. Complex. 18, 3, 377--412. Google ScholarDigital Library
- Mahajan, M., Subramanya, P. R., and Vinay, V. 2004. The combinatorial approach yields an NC algorithm for computing Pfaffians. Discr. Appl. Math. 143, 1--3, 1--16. Google ScholarDigital Library
- Mahajan, M. and Vinay, V. 1997. Determinant: Combinatorics, algorithms, complexity. Chicago J. Theor. Comput. Sci. 5. http://www.cs.uchicago.edu/publications/cjtcs.Google ScholarCross Ref
- Mohar, B. and Thomassen, C. 2001. Graphs on Surfaces. John Hopkins University Press.Google Scholar
- Papadimitriou, C. M. 1994. Computational Complexity. Addison-Wesley, Reading. MA.Google Scholar
- Reingold, O. 2005. Undirected st-connectivity in log-space. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC’05). ACM, New York, 376--385. Google ScholarDigital Library
- Reinhardt, K. and Allender, E. 2000. Making nondeterminism unambiguous. SIAM J. Comp. 29, 1118--1131. Google ScholarDigital Library
- Toda, S. 1991. Counting problems computationally equivalent to the determinant. Tech. rep. CSIM 91-07, Department of Computer Science Information Mathematics, University of Electro-Communications, Chofu-shi, Tokyo.Google Scholar
- Vadhan, S. 2001. The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31, 2, 398--427. Google ScholarDigital Library
- Valiant, L. G. 1979. The complexity of computing the permanent. Theor. Comput. Sci. 8, 189--201.Google ScholarCross Ref
- Valiant, L. G. 1992. Why is boolean complexity theory difficult? In Boolean Function Complexity, M. S. Paterson, Ed. Cambridge University Press. London Mathematical Society Lecture Notes Series 169.Google Scholar
- Vazirani, V. 1989. NC algorithms for computing the number of perfect matchings in K
3,3-free graphs and related problems. Inform. Comput. 80, 2, 152--164. Google ScholarDigital Library
- Vinay, V. July 1991. Semi-Unboundedness and complexity classes. Ph.D. thesis, Indian Institute of Science, Bangalore.Google Scholar
- Xia, M. and Zhao, W. 2006. #3-regular bipartite planar vertex cover is #p-complete. In Proceedings of the 3rd International Conference on Theory and Applications of Models of Computation (TAMC). Lecture Notes in Computer Science, vol. 3959. Springer, 356--364. Google ScholarDigital Library
- Yang, H. 1991. An NC algorithm for the general planar monotone circuit value problem. In Proceedings of 3rd IEEE Symposium on Parallel and Distributed Processing. IEEE, 196--203.Google ScholarDigital Library
- Zankó, V. 1991. #P-completeness via many-one reductions. Int. J. Found. Comput. Sci. 2, 1, 77--82.Google ScholarCross Ref
Index Terms
- Planarity, Determinants, Permanents, and (Unique) Matchings
Recommendations
Perfect Matchings in Total Domination Critical Graphs
A graph is total domination edge-critical if the addition of any edge decreases the total domination number, while a graph with minimum degree at least two is total domination vertex-critical if the removal of any vertex decreases the total domination ...
Planarity, determinants, permanents, and (unique) matchings
CSR'07: Proceedings of the Second international conference on Computer Science: theory and applicationsWe 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 ...
Comments