LOWER BOUNDS OF COMPLEXITY FOR POLARIZED POLYNOMIALS OVER FINITE FIELDS

Baliuk A. S.; Zinchenko A. S.

首页> 外文期刊>Siberian Mathematical Journal >LOWER BOUNDS OF COMPLEXITY FOR POLARIZED POLYNOMIALS OVER FINITE FIELDS

【24h】

LOWER BOUNDS OF COMPLEXITY FOR POLARIZED POLYNOMIALS OVER FINITE FIELDS

机译：在有限田间对偏振多项式的复杂性的下限

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We obtain an efficient lower bound of complexity for n-ary functions over a finite field of arbitrary order in the class of polarized polynomials. The complexity of a function is defined as the minimal possible number of nonzero terms in a polarized polynomial realizing the function.

机译：通过在偏振多项式类别的任意顺序的有限场上获得N-ARY功能的复杂性的有效下限。函数的复杂性被定义为实现功能的极化多项式中的最小可能数量的非零项。

著录项

来源
《Siberian Mathematical Journal》 |2019年第1期|共9页
作者
Baliuk A. S.; Zinchenko A. S.;
展开▼
作者单位

LLC Informat Med Irkutsk Russia;

Irkutsk State Univ Irkutsk Russia;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类数学;
关键词
lower bound of complexity; polarized polynomial; finite field;

机译：复杂性下限;偏振多项式;有限场;

相似文献

外文文献
中文文献
专利

1. LOWER BOUNDS OF COMPLEXITY FOR POLARIZED POLYNOMIALS OVER FINITE FIELDS [J] . Baliuk A. S., Zinchenko A. S. Siberian Mathematical Journal . 2019,第1期

机译：在有限田间对偏振多项式的复杂性的下限
2. Derandomizing Polynomial Identity over Finite Fields Implies Super-Polynomial Circuit Lower Bounds for NEXP [J] . Bin Fu Electronic Colloquium on Computational Complexity . 2013,第126期

机译：在有限域上对多项式身份进行去随机化意味着NEXP的超多项式电路下界
3. Lower bound for the complexity of five-valued polarized polynomials [J] . Aleksandr S.Baliuk, Anna S.Zinchenko Discrete mathematics and applications . 2017,第5期

机译：下限为五值偏振多项式的复杂性
4. A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields [C] . Michael Kaminski Annual Symposium on Theoretical Aspects of Computer Science(STACS 2005); 20050224-26; Stuttgart(DE) . 2005

机译：有限域上多项式乘法的复杂度的下界
5. Connections Between Complexity Lower Bounds and Meta-computational Upper Bounds [D] . Carmosino, Marco Leandro. 2019

机译：复杂性下限与元计算上限之间的连接
6. Algebraic complexities and algebraic curves over finite fields [O] . D. V. Chudnovsky, G. V. Chudnovsky 1987

机译：有限域上的代数复杂度和代数曲线
7. Derandomizing Polynomial Identity over Finite Fields Implies Super-Polynomial Circuit Lower Bounds for NEXP [O] . Fu, Bin 2013

机译：在有限域上去随机化多项式同一性意味着 NEXp的超多项式电路下限

LOWER BOUNDS OF COMPLEXITY FOR POLARIZED POLYNOMIALS OVER FINITE FIELDS

摘要

著录项

相似文献

相关主题

期刊订阅