A problem is presented with deterministic VLSI complexity AT det 2 =Ω(N2), but Las Vegas complexity only AT Las Vegas 2 =O (N poly(logN)). (The Las Vegas algorithm always decides correctly, but T is only the expected running time; A is the area of the chip). Previously AT Las Vegas 2 =O(N3/2 poly(logN)) has been shown for a similar problem with a more complicated algorithm. Here, we use a simple universal hashing technique based on random linear functions. We hope this will give rise to other applications of universal hashing in VLSI.