Distinguishing virtual braids in polynomial time

For $n\ge 2$ we describe an $O(l^{3}n)$-time algorithm that determines if a length $l$ virtual braid word in the standard presentation of the virtual braid group ${\mathcal{V}B}_n$ represents the trivial virtual braid.