The complexity of approximately counting stable roommate assignments-Reference-Cited by-同舟云学术

The complexity of approximately counting stable roommate assignments

Published:2012-09 Issue:5 Volume:78 Page:1579-1605
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Chebolu Prasad,Goldberg Leslie Ann,Martin Russell

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference17 articles.

1. N. Bhatnagar, S. Greenberg, D. Randall, Sampling stable marriages: why spouse-swapping wonʼt work, in: Proc. 19th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), 2008, pp. 1223–1232,.

2. The complexity of approximately counting stable matchings;Chebolu,2010

3. Linear datalog and bounded path duality of relational structures;Dalmau;Log. Methods Comput. Sci.,2005

4. The relative complexity of approximate counting problems;Dyer;Algorithmica,2004

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract);2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Solving hard stable matching problems involving groups of similar agents;Theoretical Computer Science;2020-12

3. Stable Marriage with Groups of Similar Agents;Web and Internet Economics;2018

4. FPTAS for #BIS with Degree Bounds on One Side;Proceedings of the forty-seventh annual ACM symposium on Theory of Computing;2015-06-14

5. A number of stable matchings in models of the Gale–Shapley type;Discrete Applied Mathematics;2013-12