activity
20022007
most citedA quantum lower bound for the query complexity of Simon's problem

7 citations · 8 across the 4 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

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…