- 更多网络例句与判定问题相关的网络例句 [注：此内容来源于网络，仅供参考]
-
It is well known that bipartite graphs can be recognized in linear time.
众所周知，偶图的判定问题存在线性时间算法。
-
By a complemented lattice L we mean a lattice with O, I and supplemented with an unary operation "′"satisfying O′=I, I′=O.
本文讨论可补格的一种分类问题，它是由于考虑多值逻辑的判定问题而引起的。
-
Reachability is one of the most basic and important dynamic properties of Petri nets. But the reachability decidability problem has at least exponential space complexity and no effective algorithm is found by now.
可达性是Petri网最基本最重要的动态性质之一，但一般Petri网的可达性判定问题至少具有指数空间复杂度，且目前尚无有效的判定算法。
-
Then the satisfiability of DTITL is equivalently transformed to the same problem for SFO. Since the decidability of SFO can be transformed to the satisfiability of the propositional interval temporal logic, so SFO is decidable.
利用多个命题变量等价表示有界整数，把SFO的可满足性判定问题等价转换为可判定的命题区间时序逻辑的判定问题。
-
It is applied to not only radiant imperilment comprehensive evaluation problems,but also other similar decision making problems in military,economy and real life.
由于辐射源威胁等级判定问题实际上是一类多属性评价问题，因此解决这类问题的关键是目标权重的确定。
-
Since radiant imperilment grade evaluations is a type of multiattribute decision makings, so the key to solve them is determination of weights.
由于辐射源威胁等级判定问题实际上是一类多属性评价问题，因此解决这类问题的关键是目标权重的确定。
-
The matrix representation of GLKC is given on the basis of topological characteristics of GLKC, so the problem of the mathematical description is solved successfully for the type synthesis of GLKC.
进而分析了GLKC的结构不变量，根据这些结构不变量，给出了GLKC同构判定的一般方法，即利用组合矩阵的幂序列成功地解决了GLKC的同构判定问题。
-
In this paper,one privacy-preserving signed distance protocol is presented to solve the signed distance problem based on scalar product protocol.The security and correctness of the protocol are also discussed.And then the privacy-preserving of the triangle intersection with the plane determines is taken as the example to explain its application.
基于点积协议，提出了一个保护私有信息的符号距离判定协议，解决了符号距离的判定问题，然后讨论和分析了协议的安全性与正确性，并且以保护私有信息的三角形与平面相交判定为例说明了其应用。
-
Proofs the undecidable problem via constructing a instance of PCP problem with three concurrent tasks.
现有的证明[1]通过构造三个并发任务的PCP问题实例，证明过程间并发程序分析是一个不可判定问题。
-
For MU(1),a subclasses of minimal unsatisfiable formula s,we show the solvability in polynomial time.
公式的改名是将命题变元映到变元本身或变元的否定的一个映射，对于极小不可满足公式的子类MU( 1 )中的公式，我们证明了其改名判定问题在多项式时间内是可判定的。
- 更多网络解释与判定问题相关的网络解释 [注：此内容来源于网络，仅供参考]
-
decision point：决策点,决策点
decision plan 判定方案 | decision point 决策点,决策点 | decision problem 决策问题,决策问题,决定问题,决定问题,真伪判定问题
-
decision problem：判定问题
这些概念都是针对判定问题(decision problem),也就是说,给一个问题,回答"是"还是"否",例如subset sum问题:"给一个整数集合S,有没有一个子集元素之和等于k?
-
decision problem：决策问题,判断问题
决策 decision making | 决策问题,判断问题 decision problem | 判定表 decision table
-
decision problem：决策问题,决策问题,决定问题,决定问题,真伪判定问题
decision point 决策点,决策点 | decision problem 决策问题,决策问题,决定问题,决定问题,真伪判定问题 | decision procedure 决策程序,决策程序,决策过程,决策过程,判定程序,判定方式
-
multiple decision problem：多重判定问题
multiple correlation coefficient 多重相关系数 | multiple decision problem 多重判定问题 | multiple edge 多重棱
-
semantical decision problem：语义判定问题
semantic equivalence 语义等价 | semantical decision problem 语义判定问题 | semantical paradox 语义悖论
-
two decision problem：二判定问题
two body problem 二体问题 | two decision problem 二判定问题 | two digit 二位的
-
optimization problem：优化问题
" 任何一个优化问题(optimization problem)都可以转换为等价的判定问题. 例如"一个图G最大的完全子图顶点数是多少"是优化问题,相应的判定问题是"一个图G有没有一个顶点数大于或等于k的完全子图?"这两个问题是等价的.
-
entscheidend decidable：不可判定的
entscheidbar decidable 不可判定的 | entscheidend decidable 不可判定的 | Entscheidungsproblem decision problem 判定问题
-
undecidable problem：不可判定问题
双带图灵机 two-tape Turing machine | 不可判定问题 undecidable problem | 正则序 canonical order