The complexity of the certification of properties of stable marriage

DOI10.1016/J.IPL.2004.09.006zbMath1172.91334OpenAlexW2156629035MaRDI QIDQ834962

Daniel J. Dougherty, Stanley M. Selkow

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.006

zbMATH Keywords

computational complexitycombinatorial problemsstable marriagecertificate complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)

Related Items (1)

Research and development of fringe projection-based methods in 3D shape reconstruction

Cites Work

• Complexity measures and decision tree complexity: a survey.
• Lower Bounds for the Stable Marriage Problem and Its Variants
• College Admissions and the Stability of Marriage
• Unnamed Item

This page was built for publication: The complexity of the certification of properties of stable marriage