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

Authors Dai Tri Man Lê, Stephen A. Cook, Yuli Ye



PDF
Thumbnail PDF

File

LIPIcs.CSL.2011.381.pdf
  • Filesize: 0.55 MB
  • 15 pages

Document Identifiers

Author Details

Dai Tri Man Lê
Stephen A. Cook
Yuli Ye

Cite AsGet BibTex

Dai Tri Man Lê, Stephen A. Cook, and Yuli Ye. A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 381-395, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.CSL.2011.381

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 formalize them in VCC*.
Keywords
  • bounded arithmetic
  • complexity theory
  • comparator circuits

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail