![](/img/cover-not-exists.png)
[ACM Press the 50th Annual ACM SIGACT Symposium - Los Angeles, CA, USA (2018.06.25-2018.06.29)] Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 - A simply exponential upper bound on the maximum number of stable matchings
Karlin, Anna R., Gharan, Shayan Oveis, Weber, RobbieYear:
2018
Language:
english
DOI:
10.1145/3188745.3188848
File:
PDF, 900 KB
english, 2018