Pages that link to "Item:Q3588401"
From MaRDI portal
The following pages link to The Complexity of Approximately Counting Stable Matchings (Q3588401):
Displaying 7 items.
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- The complexity of approximately counting stable matchings (Q441846) (← links)
- Stable matchings in high dimensions via the Poisson-weighted infinite tree (Q2179613) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices (Q3012842) (← links)
- The Complexity of Rationalizing Matchings (Q3596716) (← links)
- A simply exponential upper bound on the maximum number of stable matchings (Q5230350) (← links)