| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
|
|
|
|
|
|
| 関連URI |
|
|
|
|
|
|
|
| 関連情報 |
|
|
|
|
|
|
|
| 概要 |
When an operation defined on a finite set can be realized under a coding C by a computation rule in which each digit of the result of the operation depends on at most k digits of the operand, the oper...ation is said to be k-locally computable under the coding C. In this report, we show a lower bound of the code length which is needed when all logical functions with n inputs and n outputs are locally computable under a coding. The result is that the code length increases as an exponential function of n.続きを見る
|
Mendeley出力
