A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem
unpublished
Preserved Fulltext
Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem. He proved that several other problems are complete for CC, including the stable marriage problem, and finding the lexicographical first maximal matching in a bipartite graph. We suggest alternative definitions of CC based on different reducibilities and introduce a two-sorted theory VCC * based on one of them. We sharpen and simplify Subramanian's completeness proofs
fatcat:lqgtnddb5be6zijh757oefovqm