The complexity of approximately counting stable matchings
type: Item
instance of: scholarly article
title: The complexity of approximately counting stable matchings
zbMATH Open document ID: 1310.68103
author: Prasad Chebolu
author: Leslie Ann Goldberg
author: Russell Martin
published in: Theoretical Computer Science
publication date: 2012-08-08T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 6064134
zbMATH Keywords: stable marriage problem
zbMATH Keywords: approximation-preserving reduction
zbMATH Keywords: counting independent sets in bipartite graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.02.029
OpenAlex ID: W2055193025
cites work: Q3579506
cites work: Euclidean preferences
cites work: Linear Datalog and Bounded Path Duality of Relational Structures
cites work: Q4692885
cites work: The relative complexity of approximate counting problems
cites work: College Admissions and the Stability of Marriage
cites work: The Complexity of Ferromagnetic Ising with Local Fields
cites work: Approximating the Partition Function of the Ferromagnetic Potts Model
cites work: A counterexample to rapid mixing of the Ge-Stefankovic process
cites work: Three Fast Algorithms for Four Problems in Stable Marriage
cites work: Q3995616
cites work: The Complexity of Counting Stable Marriages
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
DOI: 10.1016/J.TCS.2012.02.029
description: scientific article; zbMATH DE number 6064134