1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Andrzej Dudek, Marek Karpinski, Andrzej Ruciński +1
We design a fully polynomial time approximation scheme (FPTAS) for counting the number of matchings (packings) in arbitrary 3-uniform hypergraphs of maximum degree three, referred…