Computational Complexity of Coherent Systems and the Reliability Polynomial
From MaRDI portal
Publication:3415905
DOI10.1017/S0269964800000164zbMath1134.90347MaRDI QIDQ3415905
No author found.
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Reliability, availability, maintenance, inspection in operations research (90B25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (10)
Subsignatures of systems ⋮ Algorithms and Formulae for Conversion Between System Signatures and Reliability Functions ⋮ Oriented matroid systems ⋮ Note on complexity of computing the domination of binary systems ⋮ The Barlow-Proschan importance and its generalizations with dependent components ⋮ Identities and inequalities for coherent life functions and continuum structure functions. ⋮ On the characterization of the domination of a diameter-constrained network reliability model ⋮ Unnamed Item ⋮ Domination of cyclic monotone \((s,t)\)-graphs ⋮ On the domination of hypergraphs by their edges
Cites Work
This page was built for publication: Computational Complexity of Coherent Systems and the Reliability Polynomial
