Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference35 articles.
1. V. Beiu, L. Daus, Review of reliability bounds for consecutive-k-out-of-n systems, in: IEEE 14th International Conference on Nanotechnology (IEEE-NANO), 2014, Toronto, ON, Canada, http://dx.doi.org/10.1109/NANO.2014.6968048.
2. Network design problem: Steiner trees and spanning k-trees;Bern,1987
3. Teoria statistica delle classi e calcolo delle probabilitá;Bonferroni,1932
4. G. Boole, An investigation of the laws of thought, Project Gutenberg, Release Date: February 16, 2005 [EBook number 15114].
5. Polynomially computable bounds for the probability of a union of events;Boros;Math. Oper. Res.,2014
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献