Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Approach to Calculating the Probability of Retaining the Maximal Flow
Automation and Remote Control
Hi-index | 0.00 |
Consideration was given to the so-called "Polesskii estimates" which define new, more accurate reliability boundaries of the random binary systems as compared with the classical Esary-Proshan estimates. As was later shown, these estimates can be further refined. By giving a simplified, that is, purely applied, interpretation of the formal Polesskii rules, the present author demonstrated that Polesskii's concepts in principle enable one to reach the maximum disentanglement of clutters, thus substantially approaching the reliability boundaries of the random binary systems. The results of comparing the Polesskii estimates with other possible lines to attack the approachment of the boundaries of combinatorial reliability of the random binary systems were presented.