首页> 外文OA文献 >Lower bounds on the bounded coefficient complexity of bilinear maps

【2h】

Lower bounds on the bounded coefficient complexity of bilinear maps

机译：双线性映射的有界系数复杂度的下界

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Peter Bürgisser; Universität Paderborn; Martin Lotz;
展开▼
作者单位

展开▼
年度 2013
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Lower bounds on the bounded coefficient complexity of bilinear maps [J] . Peter Burgisser, Martin Lotz Journal of the Association for Computing Machinery . 2004,第3期

机译：双线性图的有界系数复杂度的下界
2. On a Lower Bound on the Computational Complexity of a Parallel Implementation of the Branch-and-bound Method [J] . R. M. Kolpakov, M. A. Posypkin, I. Kh. Sigal Automation and Remote Control . 2010,第10期

机译：关于分支定界法并行实现的计算复杂度的下界
3. Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem [J] . R. M. KOLPAKOV, M. A. POSYPKIN Discrete mathematics and applications . 2010,第1期

机译：背包问题的分支和界线方法复杂度的上限和下限
4. Lower bounds on the bounded coefficient complexity of bilinear maps [C] . Burgisser P., Lotz M. Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on . 2002

机译：双线性图的有界系数复杂度的下界
5. Connections Between Complexity Lower Bounds and Meta-computational Upper Bounds [D] . Carmosino, Marco Leandro. 2019

机译：复杂性下限与元计算上限之间的连接
6. Estimation of upper and lower bounds of Gini coefficient by fuzzy data [O] . Reza Ashraf Ganjoei, Hossein Akbarifard, Mashaallah Mashinchi, 2020

机译：用模糊数据估计基尼系数的上下限
7. Lower bounds on the bounded coefficient complexity of bilinear maps [O] . Bürgisser, Peter, Lotz, Martin 2004

机译：双线性映射的有界系数复杂度的下界
8. The Lower Bounds on the Additive Complexity of Bilinear Problems in Terms of Some Algebraic Quantities [R] . Pan, V. Y. 1981

机译：从一些代数量的角度看双线性问题加性复杂性的下界

客服邮箱：kefu@zhangqiaokeyan.com

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

客服微信
服务号