In this paper, we discuss isomorphic factorization for tensor product of two divisible graphs and prove the conditions for the tensor product graphs to be factorized isomorphically.
本文讨论了两个可分图的张量乘积图的同构因子分解问题.给出了张量乘积图可同构因子分解的判定条件.
The field of quantum computers has been revolutionized by the work of Shor on factorization of large numbers.
最近,大数因子分解等一系列量子超快速算法的发现使量子计算机的研究取得了革命性的进展。
Isn't factorization that thing we learn in math?
Receiver 23 holds the RSA keys and starts, if the public key is not known by the transmitter, by transmitting it, that is, factorization modulus n and public exponent e, to said transmitter.
如果接收器不知道公钥,接收器23持有RSA密钥并通过向所述发送器传送它(即因式分解模数n和公共指数e)来发起。
But there is another way to look at schooling - through the lens of a method called "mastery learning," in which the student's understanding of a subject is a constant and time is a variable; when each fifth grader masters prime factorization, for instance, he moves on to greatest common factors, each at his own pace.
但是对学校教育还有另一种见解 - 需要用到一种叫作"精熟学习"(mastery learning)的方法,按照这种方法,学生们对一门科目的掌握程度是常量,而学习时间则是变量;例如,一名五年级学生只有在掌握了质因数分解之后才会继续学习最大公约数的知识,每个人都按照自己的进度推进。
In traditional schooling, time is a constant and understanding is a variable. A fifth-grade class will spend a set number of days on prime factorization and then move on to study greatest common factors - whether or not every student is ready.
在传统的学校教育中,时间是常量,掌握程度是变量。五年级学生会花固定的天数学习质因数分解,然后再学习最大公约数 - 无论是不是每位学生都做好了准备。
Its(security) is based on the intractability of the integer factorization problem as RSA, and it is able to resist the chosen-ciphertext attack against RSA and easy to be implemented.
它与RSA算法相似,其安全性基于大数因式分解的难度,能够抵抗对于RSA的选择密文攻击,并且易于软件实现。
Information technology - Security techniques - Digital signature schemes giving message recovery - Integer factorization based mechanisms
信息技术.安全技术.带电文恢复的数字签名方案.基于整数因子分解的机制
Factorization prestack depth migration by wavefield synthesizing MIG 1.8
通过波场合成进行因子分解叠前深度偏移
The unique factorization of numbers into primes has many applications in mathematical proofs, as shown below.
整数分解的惟一性在数学证明中有很多应用,下文将会提到。
We're looking for problems that, just like factorization, can be used on our smartphones and on our laptops today.
我们正在找 像数字分解那样的难题,可以用在我们如今的 智能手机和电脑上。
But unlike factorization, we need these problems to be so hard that they're even unbreakable with a quantum computer.
但是不同于数字分解, 我们需要这个难题足够难,难到它不能被量子计算机破解。
And this problem, called "integer factorization," is exactly what each of your smartphones and laptops is using right now to keep your data secure.
而这个问题,被叫做"整数分解",就是现在你们每部手机和电脑 正在用来保护你们的数据安全的方法。