1 citations · 1 across the 1 of their papers we have counts for
1 paper
Chris Cade, Ashley Montanaro, Aleksandrs Belovs
We study space and time efficient quantum algorithms for two graph problems -- deciding whether an n-vertex graph is a forest, and whether it is bipartite. Via a reduction to the…