WH LogoWH·CSBank
演算法›Ch5 NP Complete Problems
第 15 題／共 30 題
◀ AL 15/30
15. P vs NP、Polynomial-Time Verification
#AL-05-015中P vs NPPolynomial-Time Verification
  1. Assume NP≠PNP\ne P and consider the decision version of the following problems. Which of the following problems have polynomial-time verification algorithm.
📄 交大111
跳轉到第題
← 上一題下一題 →
▤完整推導請見《WH 資工筆記 · 演算法》Ch5 NP Complete Problems
本章題號 · 1–20 / 30
1234567891011121314151617181920