Computational Complexity of Coherent Systems and the Reliability Polynomial
From MaRDI portal
Recommendations
Cited in
(16)- The Barlow-Proschan importance and its generalizations with dependent components
- Domination of cyclic monotone \((s,t)\)-graphs
- On the domination of hypergraphs by their edges
- Identities and inequalities for coherent life functions and continuum structure functions.
- On the characterization of the domination of a diameter-constrained network reliability model
- Algorithms and Formulae for Conversion Between System Signatures and Reliability Functions
- Minset Splitting for Improved Reliability Computation
- scientific article; zbMATH DE number 4012285 (Why is no real title available?)
- An enumeration algorithm for combinatorial problems of the reliability analysis of binary coherent systems
- Subsignatures of systems
- scientific article; zbMATH DE number 1304836 (Why is no real title available?)
- scientific article; zbMATH DE number 2230203 (Why is no real title available?)
- scientific article; zbMATH DE number 4183154 (Why is no real title available?)
- Oriented matroid systems
- Note on complexity of computing the domination of binary systems
- Joint structure importance of components based on logic differential calculus
This page was built for publication: Computational Complexity of Coherent Systems and the Reliability Polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415905)