We define the complexity of a computational problem given by a relation using the model of computation trees together with the ostrowski complexity measure. Natural examples from linear algebra are:KERn: Compute a bas...
详细信息
Let k be a field. The author continues the work of Lickteig [SIAM J. Comput., 16 (1987), pp. 278–311 ] and extends it in two directions: (1) A lower bound on the ostrowski complexity of division in a finite extension...
详细信息
Let k be a field. The author continues the work of Lickteig [SIAM J. Comput., 16 (1987), pp. 278–311 ] and extends it in two directions: (1) A lower bound on the ostrowski complexity of division in a finite extension field A⊃k
暂无评论