A.P問(wèn)題是確定性算法多項(xiàng)式時(shí)間復(fù)雜性解決的可判定問(wèn)題B.NP問(wèn)題是確定性算法不能在多項(xiàng)式時(shí)間復(fù)雜性解決的可判定問(wèn)題C.D.
A.數(shù)值概率算法B.舍伍德算法C.拉斯維加斯算法D.蒙特卡羅算法
A.最小生成樹(shù)B.單源最短路徑C.最優(yōu)二叉搜素樹(shù)D.哈夫曼編碼樹(shù)