The complexity of the certification of properties of stable marriage

Information Processing Letters

Volumn 92, Issue 6, 2004, Pages 275-277

  Dougherty, Daniel J ^a   Selkow, Stanley M ^a  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Certificate complexity; Combinatorial problems; Computational complexity; Stable marriage

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

BLOCKING PAIRS; CERTIFICATE COMPLEXITY; COMBINATORIAL PROBLEMS; STABLE MARRIAGE;

COMPUTATIONAL COMPLEXITY;

EID: 9544252976     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.09.006     Document Type: Article

References (4)

1. H. Buhrman, R. de Wolf, Complexity measures and decision tree complexity: A survey, Theoret. Comput. Sci. 288 (2002) 21-13.
2. D. Gale, L. Shapley, College admissions and the stability of marriage, Amer. Math. Monthly 69 (1962) 9-15.
3. D. Gusfield, R.W. Irving, The Stable Marriage Problem: Structure and Algorithms, MIT Press, Cambridge, MA, 1989.
4. C. Ng, D. Hirschberg, Lower bounds for the stable marriage problem and its variants, SIAM J. Comput. 19 (1990) 71-77.