many-one

many-one的基本解释

-

多对一

与many-one相关的网络例句 [注：此内容来源于网络，仅供参考]

Firstly, all the terms concerned are split up into basic term elements-termels, then eight aspects of quantificational indexes are given: errors-in-printing ratio,'inconsistent/uncanonical spelling' ratio,'unnecessary one-many/many-one correspondence' ratio,'inequivalent term' ratio,'discrepant interdisciplinary term' ratio,'unconformable-to-GB term' ratio,'incomplete/redundant term' ratio, and overall 'term worthy of revision/discussion' ratio.

其基本方法，一是从名词集中拆分出基础要素－名词元；二是提出八项量化指标：印误率，英语拼写不一致与不规范率，非必要的一多与多一对应率，英汉名词不对等率，与交叉学科名词有异率，与国标定名不符率，收词欠完备与冗余率及总体值得修榷率。

This type of reduction is more refined than the more usual polynomial-time many-one reductions and it allows us to distinguish more classes such as

相较起来，不同处在於多对一变换只能呼叫上述副函式'''一次'''，且副函式的回传值必须'''就是'''整个变换程式回传的值。

Since every computation that can be done in logarithmic space can also be done in polynomial time it follows that if there is a logarithmic-space many-one reduction then there is also a polynomial - time many-one reduction.

若我们提供一个副函式可以在多项式时间解出&Y&，'''又'''可写出呼叫此副函式的程式并在多项式时间解出问题&X&，代表我们可以将&X&多项式时间图灵变换成&Y&。

This contrasts with many-one reducibility, which has the restriction that the program can only call the subroutine once, and the return value of the subroutine must be the return value of the program.

由於大多数的

与many-one相关的网络解释 [注：此内容来源于网络，仅供参考]

many-one reducibility：多一可归性

多对多 many-many | 多一可归性 many-one reducibility | 多至一简化 many-one reduction

many-one：多对一

many-manyrelationship多对多关系 | many-one多对一 | many-onerelationship一对多关系

many-one reducible：多一归约

创造集 creative set | 多一归约 many-one reducible | 一一归约 one-one reducible

many-one reducibility：多一可归约性

多叶函数||multivalent function | 多一可归约性||many one reducibility | 多伊林正规形||Deuring normal form

many-one reduction：多至一简化

多对多 many-many | 多一可归性 many-one reducibility | 多至一简化 many-one reduction