Filters








4 Hits in 4.7 sec

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

Uffe Flarup
2008 arXiv   pre-print
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.  ...  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  ...  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.  ... 
arXiv:0801.3408v1 fatcat:2zufyycqmbfynce7geu2lww3pm

On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth

Uffe Flarup, Laurent Lyaudet
2009 Theory of Computing Systems  
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.  ...  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  ...  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.  ... 
doi:10.1007/s00224-009-9241-3 fatcat:f5ipreagcrgyvj6zacugwaouge

On the expressive power of planar perfect matching and permanents of bounded treewidth matrices [article]

Laurent Lyaudet
2007 arXiv   pre-print
In this paper we investigate the expressive power of the above results.  ...  We show that the permanent and hamiltonian polynomials for matrices of bounded treewidth both are equivalent to arithmetic formulas.  ...  Our main findings are that: -The permanents and hamiltonians of matrices of polynomial size and bounded treewidth have the same expressive power, namely, the power of polynomial size arithmetic formulas  ... 
arXiv:0705.3751v1 fatcat:rqi3ypf4t5aefnhaj7yjd7lpaq

On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices [chapter]

Uffe Flarup, Pascal Koiran, Laurent Lyaudet
Algorithms and Computation  
In this paper we investigate the expressive power of the above results.  ...  We show that the permanent and hamiltonian polynomials for matrices of bounded treewidth both are equivalent to arithmetic formulas.  ...  Our main findings are that: -The permanents and hamiltonians of matrices of polynomial size and bounded treewidth have the same expressive power, namely, the power of polynomial size arithmetic formulas  ... 
doi:10.1007/978-3-540-77120-3_13 dblp:conf/isaac/FlarupKL07 fatcat:ycqk74ouqrefpncexeaaetksne