127 citations · 262 across the 14 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019★ 1 cited
Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits
Enric Boix-Adserà, Lior Eldar, Saeed Mehraban
The determinant can be computed by classical circuits of depth , and therefore it can also be computed in classical space . Recent progress by Ta-Shma [Ta…
cs.DS2017
Approximating the Permanent of a Random Matrix with Vanishing Mean
Lior Eldar, Saeed Mehraban
We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random…