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

Lê, D. T. M., Cook, S. A., & Ye, Y. (2011). A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem. Leibniz International Proceedings in Informatics, 381-395.

Type: Conference paper
Intellectual base: Primary research
Year: 2011
Pages: 381-395
DOI: 10.4230/lipics.csl.2011.381
Link: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.381

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Comparator-circuit complexity class CC
- Cook, Filmus, and Lê prove equivalent descriptions using weak reductions and uniform families of polynomial-size comparator circuits under specified input-copy and negation conventions.

Verification¶

Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Links previously used in the corpus¶

Before the registry existed this work was also linked 2 other ways.

Registry ID ref:2e953a91c975 · see in the full table