Pages that link to "Item:Q441846"
From MaRDI portal
The following pages link to The complexity of approximately counting stable matchings (Q441846):
Displaying 10 items.
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- Stable matchings in high dimensions via the Poisson-weighted infinite tree (Q2179613) (← links)
- Stable marriage with groups of similar agents (Q2190408) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- Disjoint stable matchings in linear time (Q2672428) (← links)
- Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735) (← links)
- The Complexity of Approximately Counting Stable Matchings (Q3588401) (← links)
- The Complexity of Rationalizing Matchings (Q3596716) (← links)
- A simply exponential upper bound on the maximum number of stable matchings (Q5230350) (← links)
- Counting vertices of integral polytopes defined by facets (Q6050234) (← links)