The complexity of approximately counting stable matchings (Q441846)

From MaRDI portal
Revision as of 19:14, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
The complexity of approximately counting stable matchings
scientific article

    Statements

    The complexity of approximately counting stable matchings (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2012
    0 references
    stable marriage problem
    0 references
    approximation-preserving reduction
    0 references
    counting independent sets in bipartite graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references