常見(jiàn)例句Fayro provan la goldo, mizero la koro. 烈火見(jiàn)真金;患難識(shí)人心.Luebke and Provan proved that the Euclidean 2-connected Steiner network problem is NP-hard, which means that there are few possibilities of existing a polynomial time algorithm for a general finite set P of points in the Euclidean plane. Luebke和Provan証明了歐幾裡德2-連通Steiner網(wǎng)絡(luò)問(wèn)題是NP-睏難的。 這意味著對(duì)一般的平麪有限點(diǎn)集而言,不大可能存在求解這個(gè)問(wèn)題的多項(xiàng)式時(shí)間算法。 返回 Provan