数学季刊 ›› 1996, Vol. 11 ›› Issue (2): 1-4.

• •    下一篇

On Fast Polynomial Algorithms and Lower Bounds of the Linear Complexity

  

  1. Xi'an  Jiaotong   University,Xi'an,China,& Aomori   University,Aomori,030   Japan


  • 收稿日期:1994-11-01 出版日期:1996-06-30 发布日期:2025-01-02

On Fast Polynomial Algorithms and Lower Bounds of the Linear Complexity

  1. Xi'an  Jiaotong   University,Xi'an,China,& Aomori   University,Aomori,030   Japan
  • Received:1994-11-01 Online:1996-06-30 Published:2025-01-02

摘要: In this paper,we discuss the fast evaluation algorithm of polynomials showed by H. T.Kung,and show some lower bounds of the linear complexity for some orthogonal linear transformations.

Abstract: In this paper,we discuss the fast evaluation algorithm of polynomials showed by H. T.Kung,and show some lower bounds of the linear complexity for some orthogonal linear transformations.

中图分类号: