您要查找的是不是：
- 一個NP-完全問題AN NP-COMPLETE PROBLEM
- 合取範式可滿足性問題(簡稱SAT問題)是一個NP完全問題。The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem.
- 能量因素與QoS各參數的相互影響構成了一個NP完全問題.A NP-Complete problem occurs when the energy factors and the QoS parameters influence each other.
- 旅行商問題(TSP)是一個有著重要工程背景、在圖論中的典型組合優化問題，已被證實是一個NP完全問題。The Traveling Salesman Problem (TSP) is a typical optimization problem, which belongs to a large family of problems classified as NP-complete. It has the important project background.
- 查找下一個find next
- 沒問題No problem.
- 每一個every last
- 不完全imperfectness
- 安全問題safety issue
- 沒有一個neither one
- 另外一個other
- 不完全的lame
- 沒有問題all serene
- 哪一個which
- 常見問題FAQ
- 出現問題go wrong
- 某一個some or other
- 不是一個而是兩個！Not one, but two!
- 重要問題an important issue
- "董事長今天要來倉庫參觀，所以你們要小心點，準備回答任何問題。""The Chairman's visiting the ware house today, so keep on your toes and be ready to answer any questions."
