... 字环 word ring 字问题 word problem 自伴边值问题 self-adjoint boundary value problem ...
基于168个网页-相关网页
In 1911, M. Dehn gave three fundamental problems in combinatorial group theory: word problem, conjugacy problem and isomorphism problem.
1911年,M.Dehn提出了组合群论的三个基本问题,即:字问题、共轭问题、同构问题。
参考来源 - 群的共轭性质与可分性质·2,447,543篇论文数据,部分数据来源于NoteExpress
辫群是一种非交换的无限群,该群中有许多困难问题是不可解的,如字问题、共轭问题和根问题等,利用这些困难问题可以去设计一些密码协议。
The braid group is infinite non-commutative group, and it has many hard problems that can be utilized to design cryptographic primitives, such as the word problem, conjugacy problem and root problem.
辫群是一种非交换的无限群,该群中有许多困难问题是不可解的,如字问题、共轭问题和根问题等,利用这些困难问题可以去设计一些密码协议。
The braid groups have many hard problems that can be utilized to design cryptographic primitives, for example, the word problem, conjugacy problem, and root problem.
他只是用一个“是”字,便回答了两个问题。
It's not just 140 characters, it's potentially $140 because they can't make the sale.
这并不只是140个字符的问题,它只是潜在的140美元,因为这些字不能卖出去。
应用推荐