On Extreme Disentanglement of Clutters in the Polesskii Estimates of the Boundaries of Combinatorial Reliability of Random Binary Systems

Author： Filin B.

Publisher： MAIK Nauka/Interperiodica

ISSN： 0005-1179

Source： Automation and Remote Control, Vol.66, Iss.9, 2005-09, pp. : 1496-1532

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Disentanglement and decoherence from classical non-Markovian noise: random telegraph noise

By Zhou Dong Lang Alex Joynt Robert

Quantum Information Processing, Vol. 9, Iss. 6, 2010-12 ,pp. : 727-747

Springer Publishing Company

Access to resources Recommend Favorite

Random generation of trees and other combinatorial objects

By Barcucci E. Del Lungo A. Pergola E.

Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. : 219-232

Elsevier

Access to resources Recommend Favorite

Biased random-key genetic algorithms for combinatorial optimization

By Gonçalves José

Journal of Heuristics, Vol. 17, Iss. 5, 2011-10 ,pp. : 487-525

Springer Publishing Company

Access to resources Recommend Favorite

Code spectrum and the reliability function: Binary symmetric channel

By Burnashev M.

Problems of Information Transmission, Vol. 42, Iss. 4, 2006-12 ,pp. : 263-281

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Left and Right Pathlengths in Random Binary Trees

By Janson Svante

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 419-429

Springer Publishing Company

Access to resources Recommend Favorite