The Complexity of Perfect Matching Problems on Dense Hypergraphs.

Marek Karpinski, Andrzej Rucinski, Edyta Szymanska

Browse the full ISAAC paper archive.