33 citations · 52 across the 13 of their papers we have counts for
Showing 2015 · cs.CCShow all
2 papers · 2 filters
cs.CC2015★ 4 cited
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k
Radu Curticapean, Mingji Xia
We identify and study relevant structural parameters for the problem PerfMatch of counting perfect matchings in a given input graph . These generalize the well-known tractable p…
cs.CC2015
Base collapse of holographic algorithms
Mingji Xia
A holographic algorithm solves a problem in domain of size , by reducing it to counting perfect matchings in planar graphs. It may simulate a -value variable by a bunch of $t…