2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DM2008★ 2 cited
On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
Uffe Flarup, Laurent Lyaudet
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…
cs.DM2007
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
Laurent Lyaudet, Pascal Koiran, Uffe Flarup
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and…