3 citations · 3 across the 1 of their papers we have counts for
1 paper
Andrew M. Childs, Robin Kothari
We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether an n-vertex graph is planar, is a forest, or does not c…