81 citations · 134 across the 18 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CC2015
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss
Radu Curticapean
Given an edge-weighted graph G, let PerfMatch(G) denote the weighted sum over all perfect matchings M in G, weighting each matching M by the product of weights of edges in M. If G…
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
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
Radu Curticapean
We devise a framework for proving tight lower bounds under the counting exponential-time hypothesis #ETH introduced by Dell et al. (ACM Transactions on Algorithms, 2014). Our frame…