The complexity of approximately counting stable matchings (Q441846): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B68
@@ Property / Mathematics Subject Classification ID: 91B68 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6064134
@@ Property / zbMATH DE Number: 6064134 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+stable marriage problem
@@ Property / zbMATH Keywords: stable marriage problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation-preserving reduction
@@ Property / zbMATH Keywords: approximation-preserving reduction / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+counting independent sets in bipartite graphs
+Normal rank

Revision as of 01:14, 30 June 2023