{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:29:37Z","timestamp":1787340577901,"version":"3.56.0"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1983,11]]},"abstract":"<jats:p>Several enumeration and reliability problems are shown to be # P-complete, and hence, at least as hard as NP-complete problems. Included are important problems in network reliability analysis, namely, computing the probability that a graph is connected and counting the number of minimum cardinality $(s,t)$-cuts or directed network cuts. Also shown to be # P-complete are counting vertex covers in a bipartite graph, counting antichains in a partial order, and approximating the probability that a graph is connected and the probability that a pair of vertices is connected.<\/jats:p>","DOI":"10.1137\/0212053","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:05:53Z","timestamp":1109225153000},"page":"777-788","source":"Crossref","is-referenced-by-count":521,"title":["The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected"],"prefix":"10.1137","volume":"12","author":[{"given":"J. Scott","family":"Provan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael O.","family":"Ball","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100206"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0603016"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130210"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/1811129.1811131"},{"key":"R5","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R6","unstructured":"J. N. Hagstrom,  Computing rooted communication reliability is #  P-complete,  1981, unpublished manuscript"},{"key":"R7","volume-title":"Inequalities","author":"Hardy G. H.","year":"1952"},{"key":"R8","volume-title":"Principles of numerical analysis","author":"Householder Alston S.","year":"1953"},{"key":"R9","unstructured":"M. Jerrum,  On the complexity of evaluating multivariate polynomials, Tech. Rep., CST-11-81, Dept. Computer Science, Univ. Edinburgh,  1981, Ph.D. thesis"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1002\/andp.18471481202"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0132031"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0212053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:40:13Z","timestamp":1787337613000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0212053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,11]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,11]]}},"alternative-id":["10.1137\/0212053"],"URL":"https:\/\/doi.org\/10.1137\/0212053","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,11]]}}}