基本 basic; fundamental代数 K理论 algebraic K-theory基本代 elementary algebra基本代理权 primary powers基本代码 basic code本代 bende; hoshiro代数基本定理 fundamentalsatz der algebra fundamental theorem of algebra代数学基本定理 fundamental theorem of algebra基本线性代数子程序 blas basic linear algebra subroutine本代蒂 bendetti本代菲 bendefy本代夫 bundev本代克 bendec本代拉 bendela; bundera本代理 original agency本代利 bendelli; benderli本代姆 bendaim本代特 bendet本代希 bendesy本代亚 bandea; bendea布本代 bubendey多本代 dobynde孟本代 muang boun tai姆本代 mbende代数 [数学] algebra◇代数闭域 algebraic closed field; 代数编码 algebraic coding; 代数变换 algebraic transformation; 代数表达式 algebraic expression; 代数簇 algebraic variety; 代数等价 algebraic equivalence; 代数对数 algebraic logarithm; 代数对应 algebraic correspondence; 代数方法 algebraic method; 代数方程(式) algebraic equation; 代数分析 algebraic analysis; 代数符号 algebraic sign; algebraic symbol; algebraic digit; 代数根 algebraic root; 代数函数 algebraic function; 代数函数域 algebraic function field; 代数和 algebraic sum; algebraic addition; 代数恒等式 algebraic identity; 代数化 algebraization; 代数基本定理 fundamental theorem of algebra; 代数积 algebraic product; 代数积分 algebraic integral; 代数集合 algebraic set; 代数几何(学) algebraic geometry; 代数解 algebraic solution; 代数解法 algebraic method; 代数解析 algebraic analysis; 代数空间 algebraic space; 代数扩张 algebraic extension; 代数 k理论 algebraic k-theory; 代数逻辑 algebraic logic; 代数平均法 method of algebraic; 代数平均误差 algebraic average error; 代数曲线 algebraic curve; 代数群 algebraic group; 代数式 algebraic expression; 代数数 algebraic number; 代数数论 algebraic number theory; theory of algebraic numbers; 代数数域 algebraic numbers field; 代数同构 isomorphism of algebra; 代数同伦 algebraic homotopy; 代数同态 algebra homomorphism; 代数拓扑(学) algebraic topology; 代数微分方程 algebraic differential equation; 代数无关 algebraic independence; 代数项 algebraic term; 代数学 algebra; 代数循环 algebraic cycle; 代数语言 algebraic language; 代数语言学 algebraic linguistics; 代数语义学 algebraic semantics; 代数学家 algebraist; 代数运算 algebraic operation; 代数整数 algebraic integer; 代数值 algebraic value
"查查词典"手机版
千万人都在用的超大词汇词典翻译APP
In 1998 , zhou , xiong and zhu improved sh algorithm by reducing this complexity to 2n - lg n . in this paper , we make further improvement . the overall complexity of computing distances is reduced to 3n - lg n 2 , which is only half that of sh algorithm 但是距离的计算量相对于其他基本代数 或者逻辑操作来说开销比较大,所以如何降低整个算法过程中距离的计算次数成为我们考虑的重点,我们改进的目标就是使得计算距离的复杂度尽可能的小。
Last modified time:Sun, 17 Aug 2025 00:29:56 GMT