The Complexity of Enumeration and Reliability Problems (Q3853129): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55878545, #quickstatements; #temporary_batch_1703762337552 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:23, 5 February 2024
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
1979
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
