Valiant, Leslie G. The complexity of enumeration and reliability problems. (English) Zbl 0419.68082 SIAM J. Comput. 8, 410-421 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 388 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 03D15 Complexity of computation (including implicit computational complexity) 05C30 Enumeration in graph theory 05C40 Connectivity 05C05 Trees 94C15 Applications of graph theory to circuits and networks Keywords:enumeration; computational complexity; counting problems; counting perfect matchings in bipartite graphs; counting maximal cliques; counting trees in a connected graph; probabilistic network; completeness results PDF BibTeX XML Cite \textit{L. G. Valiant}, SIAM J. Comput. 8, 410--421 (1979; Zbl 0419.68082) Full Text: DOI Link OpenURL