메뉴 건너뛰기




Volumn 36, Issue 1, 2000, Pages 3-20

Pairs of words with nonmaterializable mutual information

(1)  Romashchenko, A E a  

a NONE

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0042919187     PISSN: 05552923     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (15)

References (7)
  • 1
    • 77949711683 scopus 로고    scopus 로고
    • Gács P., Körner J. Common Information is Far Less Then Mutual Information // Probl. Control and Inform. Theory. 1973. V. 2. No 2. P. 149-162.
    • Gács P., Körner J. Common Information is Far Less Then Mutual Information // Probl. Control and Inform. Theory. 1973. V. 2. No 2. P. 149-162.
  • 2
    • 77949713326 scopus 로고    scopus 로고
    • Russion source
    • Russion source
  • 3
    • 77949715310 scopus 로고    scopus 로고
    • Russion source
    • Russion source
  • 4
    • 77949720088 scopus 로고    scopus 로고
    • Russion source
    • Russion source
  • 5
    • 0006974843 scopus 로고    scopus 로고
    • Muchnik An.A. On Common Information // Theoretical Computer Science. 1998. V. 207. P. 319-328.
    • Muchnik An.A. On Common Information // Theoretical Computer Science. 1998. V. 207. P. 319-328.
  • 6
    • 77949697049 scopus 로고    scopus 로고
    • Muchnik An.A., Shen A., Romashchenko A., Vereshchagin N.K. Upper semi-lattice of binary strings with the relation x is simple conditional to y: Preprint DIMACS TR 97-74. Rutgers University, 1997.
    • Muchnik An.A., Shen A., Romashchenko A., Vereshchagin N.K. Upper semi-lattice of binary strings with the relation x is simple conditional to y: Preprint DIMACS TR 97-74. Rutgers University, 1997.
  • 7
    • 0006984712 scopus 로고    scopus 로고
    • Hammer D., Romashchenko A., Shen A., Vereshchagin N. Inequalities for Shannon entropies and Kolmogorov complexities // Proc. Twelfth Annual IEEE Conference on Computational Complexity. Ulm, Germany. June, 1997. P. 13-23.
    • Hammer D., Romashchenko A., Shen A., Vereshchagin N. Inequalities for Shannon entropies and Kolmogorov complexities // Proc. Twelfth Annual IEEE Conference on Computational Complexity. Ulm, Germany. June, 1997. P. 13-23.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.