Provan

常見例句

Fayro provan la goldo, mizero la koro.
烈火見真金;患難識人心.
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ò)問題是NP-睏難的。這意味著對一般的平麪有限點集而言,不大可能存在求解這個問題的多項式時間算法。