AbstractThe Shannon complexity of a function system over aq-element finite field which contains Complexity of Function Systems over a Finite Field in the Class of Polarized Polynomial Forms
首页> 外文期刊>Moscow University Computational Mathematics and Cybernetics >Complexity of Function Systems over a Finite Field in the Class of Polarized Polynomial Forms
【24h】

Complexity of Function Systems over a Finite Field in the Class of Polarized Polynomial Forms

机译:一类极化多项式形式的有限域上函数系统的复杂性

获取原文
获取原文并翻译 | 示例
       

摘要

AbstractThe Shannon complexity of a function system over aq-element finite field which containsmfunctions ofnvariables in the class of polarized polynomial forms is exactly evaluated:LqPPF(n,m) =qnfor alln≥ 1,m≥ 2, and all possible oddq. It has previously been known thatL2PPF(n,m) = 2nandL3PPF(n,m) = 3nfor alln≥ 1 andm≥ 2.
机译: 摘要 q -元素有限域上的功能系统的Shannon复杂度其中包含对极化多项式形式的类别中的 n n变量的 m 函数的精确评估: L q PPF n,m ) = q n 对于所有 n ≥ 1, m ≥2,以及所有可能的奇数 q 。以前已经知道 L 2 PPF n,m )= 2 <上标> n L 3 PPF n,m )= 3 n 对于所有 n ≥1和 m ≥2。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号