·2,447,543篇论文数据,部分数据来源于NoteExpress
An early study gave participants abundant time to complete problem solving and word association exercises.
一项早期研究给参与者充裕的时间来解答问题并完成词汇联想训练。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题,对它的研究有重要的理论意义。
you have a mathematically complete problem.
这个问题就转变为数学问题了
Mathematically complete problem is that you can find the function x of t by saying that the second derivative of the function is equal to -k over m times the function.
这个数学问题就是,你可以求出函数 x,只要令函数的二阶导数,等于 -k 除以 m 再乘以函数
And the context of sorting, the worst case is your handed a problem that's in complete reverse order because that implies you have - to do as more work that could possibly-- that you could-- you have to do more work than you would of course if things were in perfect order.
在排序的环境中,最糟糕的情况是待排序的序列是,完全逆序的,在这种情况下,你不得不做更多的工作-,比起一个较理想顺序的序列,你必须花费更多的努力。
应用推荐