1 citations · 1 across the 2 of their papers we have counts for
2 papers
quant-ph2012
Generalizing and Derandomizing Gurvits's Approximation Algorithm for the Permanent
Scott Aaronson, Travis Hance
Around 2002, Leonid Gurvits gave a striking randomized algorithm to approximate the permanent of an n*n matrix A. The algorithm runs in O(n^2/eps^2) time, and approximates Per(A) t…
math.CO2012★ 1 cited
An Eulerian permutation statistic and generalizations
Travis Hance, Nan Li
Recently, the second author studied an Eulerian statistic (called cover) in the context of convex polytopes, and proved an equal joint distribution of (cover,des) with (des,exc). I…