37 citations · 72 across the 10 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2010★ 7 cited
The Complexity of Approximately Counting Stable Roommate Assignments
Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the -attribute model, in which the preference lists are determined by dot…
cs.CC2010★ 23 cited
The Complexity of Approximately Counting Stable Matchings
Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
We investigate the complexity of approximately counting stable matchings in the -attribute model, where the preference lists are determined by dot products of "preference vector…