The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Lower bounds for the stable marriage problem and its variants
SIAM Journal on Computing
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Hi-index | 0.89 |
We give some lower bounds on the certificate complexity of some problems concerning stable marriage, answering a question of Gusfield and Irving.