A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem ∗

Content Provider	CiteSeerX
Author	Ye, Yuli Lê, Man Tri, Dai Cook, Stephen A.
Abstract	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 for the above two problems and show how to formalize them in VCC ∗.
File Format	PDF
Access Restriction	Open
Subject Keyword	Complexity Class Cc Subramanian Completeness Proof Stable Marriage Problem Complexity Class Associated Alternative Definition Different Reducibilities Lexicographical First Maximal Matching Comparator Circuit Value Problem Two-sorted Theory Vcc Bipartite Graph Formal Theory Several Problem
Content Type	Text