Author Archives: jdcranch

Efficient computational matchings and lax sexual morality

Hall’s marriage theorem is well-known and frequently useful, but it’s a nightmare from a computational perspective. The standard proof can be turned into an algorithm which finds a matching, but it’s impracticably slow. The reason for this is that the … Continue reading

Posted in Uncategorized | Leave a comment