The Complexity of Counting Stable Marriages

This publication has 7 references indexed in Scilit:

• An efficient algorithm for the “stable roommates” problem
  Published by Elsevier ,2004
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
  SIAM Journal on Computing, 1983
• Notes on Introductory Combinatorics
  Published by Springer Nature ,1983
• The Complexity of Enumeration and Reliability Problems
  SIAM Journal on Computing, 1979
• The complexity of computing the permanent
  Theoretical Computer Science, 1979
• The stable marriage problem
  Communications of the ACM, 1971
• College Admissions and the Stability of Marriage
  The American Mathematical Monthly, 1962