A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem
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 formalize them in VCC*.
bounded arithmetic
complexity theory
comparator circuits
381-395
Regular Paper
Dai Tri Man
Lê
Dai Tri Man Lê
Stephen A.
Cook
Stephen A. Cook
Yuli
Ye
Yuli Ye
10.4230/LIPIcs.CSL.2011.381
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode