Sciweavers

COCO
1998
Springer
123views Algorithms» more  COCO 1998»
14 years 3 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt