Greatest Common Divisor is one of the basic subjects in computational number theory, it has a wide application in encryption and analysis of cryptography.
最大公因子计算是计算数论的基础课题之一，它在密码算法和密码分析中有着非常广泛的应用。
Communication complexity theory is a abstract computational model, which deal with the number of communication between the inner of system.
通讯复杂性理论是一个计算抽象模型，它关心的是系统内部之间的数据通讯量的大小。
Topics covered range from computational complexity, algebraic geometry, dynamics, through to number theory and quantum groups.
直达数论和量组，题目由于计算的复杂性，代数学的几何学，力学包括范围。
Topics covered range from computational complexity, algebraic geometry, dynamics, through to number theory and quantum groups.
直达数论和量组，题目由于计算的复杂性，代数学的几何学，力学包括范围。
应用推荐