您要查找的是不是：
- 一个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."
