Zi-Hong Yi

Diffuse Gaussian Truncation For Deterministic Approximate Counting

We give deterministic FPTASes for two dense counting problems on which the known deterministic algorithms, based on zero-free interpolation, run in quasipolynomial time. For fixed $0<\gamma<1/2$ and $0<\theta\leq1$, the first approximates $\mathrm{haf}(A)$ for a symmetric matrix $A$ when its support graph $G$ has minim...