eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2011-08-31
381
395
10.4230/LIPIcs.CSL.2011.381
article
A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem
Lê, Dai Tri Man
Cook, Stephen A.
Ye, Yuli
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*.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol012-csl2011/LIPIcs.CSL.2011.381/LIPIcs.CSL.2011.381.pdf
bounded arithmetic
complexity theory
comparator circuits