On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth

Uffe Flarup, Laurent Lyaudet

Research output: Contribution to conference without publisher/journalPaperResearchpeer-review

Abstract

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.
Original languageEnglish
Publication date2008
Publication statusPublished - 2008
EventInternational Computer Science Symposium in Russia - Moskva, Russian Federation
Duration: 7. Jun 200812. Jun 2008
Conference number: 3

Conference

ConferenceInternational Computer Science Symposium in Russia
Number3
CountryRussian Federation
CityMoskva
Period07/06/200812/06/2008

    Fingerprint

Cite this

Flarup, U., & Lyaudet, L. (2008). On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth. Paper presented at International Computer Science Symposium in Russia, Moskva, Russian Federation.