查询词典 triangular factorization

Leibniz saw that the uniqueness of prime factorization suggests a central role for prime numbers in the universal characteristic, a striking anticipation of G?

莱布尼茨看到，素因子分解的单值性表明素数在普遍文字中的核心作用，明显是歌德尔编码的先声。

Prime Factorization. Take your solutions for isprime and getfactors in the previous problems and create a function that takes an integer as input and returns a list of its prime factors.

素因子。以刚才练习中的 isprime 和 getfactors 函数为基础编写一个函数，它接受一个整数作为参数，返回该整数所有素数因子的列表。

As a consequence , the paper provides a partial solution to an open problem of minor prime factorization as well as to a recent conjecture on minor prime factorizability for nD polynomial matrices.

于是，本文为多项式矩阵提出了一种针对解决主子式分解难题和当前对主子式分解的推测的方法。

The 1-generator quasi-cyclic codes and their duals are the most frequently encountered QC codes in the literature. Séguin discusses the construction and the enumeration of 1-generator QC codes in the special case where the prime factorization of x~m — 1 is the same in IF_qn as in IF_q.

单生成元的拟循环码及其对偶码是拟循环码中研究最多的一种。Séguin在要求x~m-1在F_q及F_中具有相同的分解的条件下，讨论了单生成元的拟循环码的结构及计数。

Prime Factorization.

素因子。以刚才练习中的 isprime 和 getfactors 函数为基础编写一个函数，它接受一个整数作为参数，返回该整数所有素数因子的列表。

In the following two cases:(1)gcd=1;(2) N=p〓, where p denotes the characteristic of the finite field GF, by using the factorization of the polynomial in finite field, the counting function N〓 is showed, the expected value of the linear complexity E〓 is determined, and a useful lower bound on the expected value of the k-error linear complexity E〓 is established.(7) The stability of the lattice structure for pseudorandom number sequences is put forward.

利用多项式的因式分解等简单工具，研究了任意有限域GF上，周期N与p互素以及N ＝P〓这两种情况下，计数函数N〓，的值，即线性复杂皮为c的N-周期序列的个数，并给出了线性复杂度的数学期望E〓的值以及k-错线性复杂度的数学期望E〓的一个有用的下界，这里p表示有限域GF的特征。

In the following two cases:(1)gcd = 1 ;(2)N = p~v, where p denotes thecharacteristic of the finite field GF, by using the factorization of the polynomialin finite field, the counting function N_(N,0) is showed, the expected value of thelinear complexity E_(N,0) is determined, and a useful lower bound on the expectedvalue of the k-error linear complexity E_ is established.(7) The stability of the lattice structure for pseudorandom number sequences is putforward.

利用多项式的因式分解等简单工具，研究了任意有限域GF上，周期N与p互素以及N = p~v这两种情况下，计数函数NN，0 的值，即线性复杂度为c的N-周期序列的个数，并给出了线性复杂度的数学期望EN，0的值以及k-错线性复杂度的数学期望EN，k的一个有用的下界，这里p表示有限域GF的特征。

We thus give a detailed discussion for QCD factorization involved the complete chirally enhanced power corrections for B decays to two light pseudoscalar mesons.

我们将QCD因子化推广到包含弱电企鹅算符的贡献，并论证了QCD因子化的预言是重整化标度无关的，也是规范不变的。

Based on it, a new efficient implementation of preconditioned conjugate gradient is put forward to solve the Gauss-Newton equation and save the cost on computation with the same exactly quadratic convergence to the traditional choleski factorization.

新算法与传统的使用Choleski技术的Gauss-Newton法具有相同的收敛速率，但在求解 Gauss-Newton方程组时减少了代数运算的计算量。

The first kind of the digital signature schemes is based on the discrete logarithm problem and second kind of the digital signature scheme is based on discrete logarithm and factorization problem, the third kind of the digital signature schemes is based on quadratic residue problem.

本文第一章对数字签名方案进行分类，根据数字签名方案所基于的数学问题，将签名方案分为：基于离散对数问题的数字签名方案，基于素因子分解问题的数字签名方案和基于二次剩余问题的签名方案。

Many will continue to choose to live in duality and in conflict.

许多人将继续选择活在二元对立性和冲突中。

I find that students of the University of Physical Education all wear sportswear at first sight.

我发现：体育大学的学生乍一看，都是穿运动衣，大家都一样