Bounds on One-to-One Coding of Graph Vertices
スポンサーリンク
概要
- 論文の詳細を見る
- 2005-11-20
著者
-
YANAGIDA MASAHIRO
DEPARTMENT OF MATHEMATICAL INFORMATION SCIENCE, TOKYO UNIVERSITY OF SCIENCE
-
Yanagida Masahiro
Department Of Mathematical Information Science Faculty Of Science Tokyo University Of Science
-
Yanagida Masahiro
Tokyo Univ. Sci. Tokyo Jpn
-
MITANI Ryoji
Department of Mathematical Information Science, Tokyo University of Science
-
Mitani Ryoji
Department Of Mathematical Information Science Tokyo University Of Science
-
Yanagida Masahiro
Department Of Applied Mathematics Faculty Of Science Science University Of Tokyo
関連論文
- QUASINORMALITY AND FUGLEDE-PUTNAM THEOREM FOR CLASS A(s,t) OPERATORS
- Mandibular Displacement during Clenching in the Intercuspal Position
- A Dropping Method for Showing Some Entropy Inequalities
- ORDER PRESERVING OPERATOR INEQUALITIES VIA FURUTA INEQUALITY
- Latin Square and Entropy in Doubly Stochastic Transitions
- On a Strong Form of the Data Processing Inequality
- An Improved Bound in Guessing
- Bounds on One-to-One Coding of Graph Vertices