判定问题 meaning in English
entscheidungsproblem decision problem
Examples
- The scheme is provably secure against attack under post - processing model provided the hardness assumption of the decisional dffie - hellm an problem as well as the existence of collision free hash functions
方案完备性、可靠性证明是基于diffe - hellman判定问题是难的以及强无碰撞散列函数是存在的这两个假设完成的。 - In proceedings of the workshop on selected areas of cryptography , kingston , on , may 1994 , pp . 120 - 128 . 11 naccache d , stern j . a new public - key cryptosystem based on higher residues . in proc
在求解点圆包含判定问题时， li的方法中计算双方均能得到距离的具体值，从而能够推断出对方点的大致位置信息对方点所在的一个圆弧。 - Another important problem in multiple - valued logic completeness theory is decision for sheffer functions , which reduced to determining the minimal covering of precomplete classes in multiple - valued logic
多值逻辑完备性理论中的另一重要问题是sheffer函数的判定问题，此问题可归结为定出所有极大封闭集(准完备集)的最小覆盖。 - This paper focus on the following research work : 1 . analyze the existing basic public - key encryption schemes , after that an efficient certificate - associated public key encryption scheme is povided and implemented
研究了传统公钥密码体制，设计并实现了基于diffiehellman判定问题，辅以hash函数和公钥证书进行加密和解密，安全性可证明的概率型非对称密码系统。 - Although most of domination numbers have good applying background , the decision problems corresponding to those are np - complete or np - hard . thus it is interesting to investigate the bounds of those . it is useful to design their algorithm
虽然许多类的控制数有很好的应用背景，但其相应的判定问题是np完全问题或np困难问题。因而，对于控制数的上下界的精确估计是人们感兴趣的一个问题，它对于设计相应的近似算法具有实际意义。