The complexity of approximately counting stable roommate assignments (Q440007): Difference between revisions

@@ Property / cites work @@
+Q3579506
@@ Property / cites work: Q3579506 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Approximately Counting Stable Matchings
+Normal rank
@@ Property / cites work @@
+Linear Datalog and Bounded Path Duality of Relational Structures
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+Normal rank
@@ Property / cites work @@
+College Admissions and the Stability of Marriage
@@ Property / cites work: College Admissions and the Stability of Marriage / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Ferromagnetic Ising with Local Fields
+Normal rank
@@ Property / cites work @@
+The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
+Normal rank
@@ Property / cites work @@
+Q3995616
@@ Property / cites work: Q3995616 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the “stable roommates” problem
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Stable Marriages
@@ Property / cites work: The Complexity of Counting Stable Marriages / rank @@
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+On Unapproximable Versions of $NP$-Complete Problems
+Normal rank