ACM Symposium on Theory of Computing, STOC 2018


Article Details
Title: A simply exponential upper bound on the maximum number of stable matchings
Article URLs:
Alternative Article URLs:
Authors: Anna R. Karlin
  • University of Washington
Shayan Oveis Gharan
  • University of Washington
Robbie Weber
  • University of Washington
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1420381, 1552097
DBLP Key: conf/stoc/KarlinGW18
Author Comments:

Discuss this paper and its artifacts below