We use network coding, i. e. , allowing intermediate nodes to code, the problem can be formulated as a linear program problem and has a polynomial-time solution.

利用网络编码，允许中间节点进行信息编码，最小能量广播问题可以转化为一个线性规划问题，并且具有一个多项式时间解。

youdao

It is intended to prove that the of the optimum displaying problems related with geometry data solution can be found in polynomial time, under certain condition.

证明在一定条件下，与地理相关数据的最优显示问题在多项式时间内可解。

youdao

Note: Your solution should be in polynomial time complexity.

注意：你的解法应该满足多项式时间复杂度。

youdao