scientific article; zbMATH DE number 176261

MaRDI QIDQ4035368zbMATH OpenFDO

Authors J. Scott Provan

Publication date 18 May 1993

zbMATH Keywords

Boolean circuit theoryBoolean functioncomplexitycomputational problemsreliability computation schemesreliability problems

Mathematics Subject Classification ID

Combinatorial probability (60C05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 2123418
• scientific article; zbMATH DE number 3989366
• A practical comparison of several algorithms for reliability calculations
• scientific article; zbMATH DE number 4012495
• Combinatorial-graphic method of reliability analysis of complex systems with monotone Boolean functions

Cited in

(5)

• Two-path subsets: Efficient counting and applications to performability analysis
• On Reliable Computation by Noisy Random Boolean Formulas
• scientific article; zbMATH DE number 5547835 (Why is no real title available?)
• scientific article; zbMATH DE number 3989366 (Why is no real title available?)
• A practical comparison of several algorithms for reliability calculations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035368)