On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)

  • Uffe Flarup
  • Laurent Lyaudet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5010)


Some 25 years ago Valiant introduced an algebraic model of computation in order to study the complexity of evaluating families of polynomials. The theory was introduced along with the complexity classes Open image in new window and Open image in new window which are analogues of the classical classes Open image in new window and Open image in new window . Families of polynomials that are difficult to evaluate (that is, Open image in new window -complete) includes the permanent and hamiltonian polynomials.

In a previous paper the authors together with P. Koiran studied the expressive power of permanent and hamiltonian polynomials of matrices of bounded treewidth, as well as the expressive power of perfect matchings of planar graphs. It was established that the permanent and hamiltonian polynomials of matrices of bounded treewidth are equivalent to arithmetic formulas. Also, the sum of weights of perfect matchings of planar graphs was shown to be equivalent to (weakly) skew circuits.

In this paper we continue the research in the direction described above, and study the expressive power of permanents, hamiltonians and perfect matchings of matrices that have bounded pathwidth or bounded cliquewidth. In particular, we prove that permanents, hamiltonians and perfect matchings of matrices that have bounded pathwidth express exactly arithmetic formulas. This is an improvement of our previous result for matrices of bounded treewidth. Also, for matrices of bounded weighted cliquewidth we show membership in Open image in new window for these polynomials.


Planar Graph Weighted Graph Hamiltonian Cycle Expressive Power Parse Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ben-Or, M., Cleve, R.: Computing Algebraic Formulas Using a Constant Number of Registers. In: STOC 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 254–257. ACM, New York (1988)Google Scholar
  2. 2.
    Corneil, D., Rotics, U.: On the Relationship Between Clique-Width and Treewidth. SIAM Journal on Computing 34, 825–847 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Courcelle, B., Engelfriet, J., Rozenberg, G.: Context-free Handle-rewriting Hypergraph Grammars. In: Graph-Grammars and Their Application to Computer Science, pp. 253–268 (1990)Google Scholar
  4. 4.
    Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics 108, 23–52 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Courcelle, B., Twigg, A.: Compact Forbidden-Set Routing. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 37–48. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Flarup, U., Koiran, P., Lyaudet, L.: On the expressive power of planar perfect matching and permanents of bounded treewidth matrices. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 124–136. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Flarup, U., Lyaudet, L.: On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth. Research Report RR2008-05, ENS Lyon (2008),
  10. 10.
    Johansson, O.: Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs. Congressus Numerantium 132, 39–60 (1998)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Kasteleyn, P.W.: Graph theory and crystal physics. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 43–110. Academic Press, London (1967)Google Scholar
  12. 12.
    Lyaudet, L., Todinca, I.: Private communication (2007)Google Scholar
  13. 13.
    Makowsky, J.A., Meer, K.: Polynomials of bounded treewidth. In: Cucker, F., Maurice Rojas, J. (eds.) Foundations of Computational Mathematics, Proceedings of the Smalefest 2000, vol. 2002, pp. 211–250. World Scientific, Singapore (2002)Google Scholar
  14. 14.
    Malod, G.: Polynômes et coefficients. Ph.D. thesis (2003)Google Scholar
  15. 15.
    Malod, G., Portier, N.: Characterizing Valiant’s Algebraic Complexity Classes. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 704–716. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Toda, S.: Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions on Information and Systems E75-D, 116–124 (1992)Google Scholar
  17. 17.
    Valiant, L.G.: Completeness classes in algebra. In: Proc. 11th ACM Symposium on Theory of Computing, pp. 249–261 (1979)Google Scholar
  18. 18.
    Valiant, L.G.: Reducibility by algebraic projections. In: Logic and Algorithmic (an International Symposium held in honour of Ernst Specker). Monographie n o 30 de L’Enseignement Mathématique, pp. 365–380 (1982)Google Scholar
  19. 19.
    Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8, 181–201 (1979)CrossRefMathSciNetGoogle Scholar
  20. 20.
    Wanke, E.: k-NLC Graphs and Polynomial Algorithms. Discrete Applied Mathematics 54, 251–266 (1994)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Uffe Flarup
    • 1
  • Laurent Lyaudet
    • 2
  1. 1.Department of Mathematics and Computer ScienceSyddansk UniversitetOdense MDenmark
  2. 2.Laboratoire de l’Informatique du ParallélismeÉcole Normale Supérieure de LyonLyon Cedex 07France

Personalised recommendations