The Complexity of Enumeration and Reliability Problems (Q3853129)

From MaRDI portal
Revision as of 13:25, 28 December 2023 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q55878545, #quickstatements; #temporary_batch_1703762337552)
scientific article
Language Label Description Also known as
English
The Complexity of Enumeration and Reliability Problems
scientific article

    Statements

    The Complexity of Enumeration and Reliability Problems (English)
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    enumeration
    0 references
    computational complexity
    0 references
    counting problems
    0 references
    counting perfect matchings in bipartite graphs
    0 references
    counting maximal cliques
    0 references
    counting trees in a connected graph
    0 references
    probabilistic network
    0 references
    completeness results
    0 references
    0 references